cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A160536 a(n) = Fibonacci(n) + n^2.

Original entry on oeis.org

0, 2, 5, 11, 19, 30, 44, 62, 85, 115, 155, 210, 288, 402, 573, 835, 1243, 1886, 2908, 4542, 7165, 11387, 18195, 29186, 46944, 75650, 122069, 197147, 318595, 515070, 832940, 1347230, 2179333, 3525667, 5704043, 9228690, 14931648, 24159186, 39089613, 63247507
Offset: 0

Views

Author

Leonardo Sznajder, May 18 2009

Keywords

Examples

			a(6) = Fibonacci(6) + 6^2 = 8 + 36 = 44.
		

Crossrefs

Programs

Formula

a(n) = a(n-4) - a(n-3) - 2*a(n-2) + 3*a(n-1) - 2 for n > 3; a(0)=0, a(1)=2, a(2)=5, a(3)=11. - Klaus Brockhaus, May 22 2009
G.f.: x*(2-3*x+x^2-2*x^3) / ((1-x)^3*(1-x-x^2)). - Klaus Brockhaus, May 22 2009

Extensions

Edited and extended by Klaus Brockhaus, May 22 2009