Voozh

A212272

a(n) = Fibonacci(n) + n^3.

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).

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, Feb 13 2026

MATHEMATICA

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

PROG