A259969 a(n) = n*A259968(n).

0, 1, 2, 9, 24, 50, 102, 210, 424, 837, 1630, 3146, 6024, 11453, 21644, 40695, 76176, 142035, 263916, 488870, 903060, 1663998, 3059166, 5612483, 10277448, 18787150, 34287916, 62485371, 113715448, 206683725, 375211710, 680399005, 1232533696, 2230537914

Offset: 0

Author

N. J. A. Sloane, Jul 11 2015

Keywords

• nonn
• easy

References

• R. K. Guy, Letter to N. J. A. Sloane, Feb 05 1986.

Links

• Colin Barker, Table of n, a(n) for n = 0..1000
• R. K. Guy, Letter to N. J. A. Sloane, Feb 1986
• Index entries for linear recurrences with constant coefficients, signature (4,-6,6,-5,2,-1).

Crossrefs

Cf. A259968, A259967.

Programs

Haskell

a259967 n = a259967_list !! n
a259967_list = 3 : 2 : 2 : 5 : zipWith3 (((+) .) . (+))
   a259967_list (drop 2 a259967_list) (drop 3 a259967_list)
-- Reinhard Zumkeller, Jul 12 2015

PARI

concat(0, Vec(x*(x^4-6*x^3+7*x^2-2*x+1)/(x^3-x^2+2*x-1)^2 + O(x^40))) \\ Colin Barker, Jul 12 2015

Formula

G.f.: x*(x^4-6*x^3+7*x^2-2*x+1) / (x^3-x^2+2*x-1)^2. - Colin Barker, Jul 12 2015

Extensions

a(28)-a(33) from Hiroaki Yamanouchi, Jul 12 2015