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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A212272 a(n) = Fibonacci(n) + n^3. 4
0, 2, 9, 29, 67, 130, 224, 356, 533, 763, 1055, 1420, 1872, 2430, 3121, 3985, 5083, 6510, 8416, 11040, 14765, 20207, 28359, 40824, 60192, 90650, 138969, 216101, 339763, 538618, 859040, 1376060, 2211077, 3560515, 5742191, 9270340, 14977008, 24208470, 39143041 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Bruno Berselli, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (5,-9,6,1,-3,1).

FORMULA

G.f.: x*(2-x+2*x^2-9*x^3)/((1-x-x^2)*(1-x)^4).

MATHEMATICA

Table[Fibonacci[n] + n^3, {n, 0, 38}]

PROG

(PARI) for(n=0, 38, print1(fibonacci(n)+n^3", "));

(MAGMA) [Fibonacci(n)+n^3: n in [0..38]];

CROSSREFS

Cf. A000045, A000578; A001611, A002062, A160536.

Sequence in context: A041877 A090208 A123058 * A062452 A265440 A152891

Adjacent sequences:  A212269 A212270 A212271 * A212273 A212274 A212275

KEYWORD

nonn,easy

AUTHOR

Bruno Berselli, May 09 2012

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 20 20:08 EDT 2021. Contains 345231 sequences. (Running on oeis4.)