# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a212272 Showing 1-1 of 1 %I A212272 #14 Sep 08 2022 08:46:02 %S A212272 0,2,9,29,67,130,224,356,533,763,1055,1420,1872,2430,3121,3985,5083, %T A212272 6510,8416,11040,14765,20207,28359,40824,60192,90650,138969,216101, %U A212272 339763,538618,859040,1376060,2211077,3560515,5742191,9270340,14977008,24208470,39143041 %N A212272 a(n) = Fibonacci(n) + n^3. %H A212272 Bruno Berselli, Table of n, a(n) for n = 0..1000 %H A212272 Index entries for linear recurrences with constant coefficients, signature (5,-9,6,1,-3,1). %F A212272 G.f.: x*(2-x+2*x^2-9*x^3)/((1-x-x^2)*(1-x)^4). %t A212272 Table[Fibonacci[n] + n^3, {n, 0, 38}] %o A212272 (PARI) for(n=0, 38, print1(fibonacci(n)+n^3", ")); %o A212272 (Magma) [Fibonacci(n)+n^3: n in [0..38]]; %Y A212272 Cf. A000045, A000578; A001611, A002062, A160536. %K A212272 nonn,easy %O A212272 0,2 %A A212272 _Bruno Berselli_, May 09 2012 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE