login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053809 Second partial sums of A001891. 2
1, 6, 21, 57, 133, 281, 554, 1039, 1878, 3302, 5686, 9638, 16143, 26796, 44179, 72471, 118435, 193015, 313920, 509805, 827036, 1340636, 2171996, 3517532, 5695053, 9218786, 14920769, 24147269, 39076593, 63233317, 102320326 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
REFERENCES
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 194-196.
LINKS
FORMULA
a(n) = a(n-1) + a(n-2) + (2*n+3)*C(n+2, 2)/3; a(-x)=0.
a(n) = Fibonacci(n+10) - (2*n^3 + 27*n^2 + 145*n + 324)/6.
G.f.: (1+x)/((1-x)^4*(1-x-x^2)).
a(n) = 5*a(n-1) - 9*a(n-2) + 6*a(n-3) + a(n-4) - 3*a(n-5) + a(n-6). - Wesley Ivan Hurt, Apr 21 2021
MATHEMATICA
Table[Fibonacci[n+10] - (2*n^3+27*n^2+145*n+324)/6, {n, 0, 40}] (* G. C. Greubel, Jul 06 2019 *)
PROG
(PARI) vector(40, n, n--; fibonacci(n+10) - (2*n^3 + 27*n^2 + 145*n + 324)/6) \\ G. C. Greubel, Jul 06 2019
(Magma) [Fibonacci(n+10) - (2*n^3 + 27*n^2 + 145*n + 324)/6: n in [0..40]]; // G. C. Greubel, Jul 06 2019
(Sage) [fibonacci(n+10) - (2*n^3 + 27*n^2 + 145*n + 324)/6 for n in (0..40)] # G. C. Greubel, Jul 06 2019
(GAP) List([0..40], n-> Fibonacci(n+10) - (2*n^3 + 27*n^2 + 145*n + 324)/6) # G. C. Greubel, Jul 06 2019
CROSSREFS
Right-hand column 9 of triangle A011794. Pairwise sums of A014166.
Sequence in context: A056414 A056341 A144899 * A290891 A047520 A294836
KEYWORD
easy,nonn
AUTHOR
Barry E. Williams, Mar 27 2000
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)