OFFSET
2,2
LINKS
Colin Barker, Table of n, a(n) for n = 2..1000
Jennifer Lansing, Largest Values for the Stern Sequence, J. Integer Seqs., 17 (2014), #14.7.5.
Index entries for linear recurrences with constant coefficients, signature (1,1).
FORMULA
a(n) = a(n-1)+a(n-2) for n>9. - Colin Barker, Jul 10 2015
G.f.: -x^2*(x^7+x^6+x^5+2*x^4+3*x^3+x^2+2*x+1) / (x^2+x-1). - Colin Barker, Jul 10 2015
MAPLE
A244473 := proc(n)
if n < 8 then
op(n, [-1, 1, 3, 5, 11, 18, 30]) ;
else
combinat[fibonacci](n+1)+5*combinat[fibonacci](n-4) ;
end if;
end proc:
seq(A244473(n), n=2..50) ; # R. J. Mathar, Jul 05 2014
MATHEMATICA
Join[{1, 3, 5, 11, 18, 30}, LinearRecurrence[{1, 1}, {49, 80}, 40]] (* Harvey P. Dale, Jan 13 2015 *)
PROG
(PARI) Vec(-x^2*(x^7+x^6+x^5+2*x^4+3*x^3+x^2+2*x+1)/(x^2+x-1) + O(x^100)) \\ Colin Barker, Jul 10 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jul 01 2014
STATUS
approved