OFFSET
1,1
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..10001
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).
FORMULA
a(n) = A007310((5*n)-3).
a(2n+1) = 5*A016921(n) for all n >= 0.
From M. F. Hasler, Nov 09 2024: (Start)
a(n) = a(n-1) + a(n-2) + a(n-3) for n > 3, a(1..3) = (5, 19, 35).
a(n) = a(n-2) + 30 for n > 2, with a(1..2) = (5, 19).
a(2n-1) = 30n - 25, a(2n) = 30n - 11.
G.f.: x*(5 + 14*x + 11*x^2)/((1 - x)^2*(1 + x)). (End)
E.g.f.: 11 + (15*x - 11)*cosh(x) + 5*(3*x - 2)*sinh(x). - Stefano Spezia, Nov 12 2024
MATHEMATICA
a[n_] := 15 n + Mod[n, 2] - 11;
Array[a, 100] (* Jean-François Alcover, Mar 14 2016 *)
PROG
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Antti Karttunen, Feb 22 2015
EXTENSIONS
New definition from M. F. Hasler, Nov 09 2024
STATUS
approved
