The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A259969 a(n) = n*A259968(n). 3
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 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). 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 PROG (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 (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 CROSSREFS Cf. A259968, A259967. Sequence in context: A185669 A294872 A006002 * A023662 A131357 A274543 Adjacent sequences:  A259966 A259967 A259968 * A259970 A259971 A259972 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Jul 11 2015 EXTENSIONS a(28)-a(33) from Hiroaki Yamanouchi, Jul 12 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 18 05:44 EDT 2021. Contains 343072 sequences. (Running on oeis4.)