A022363 Fibonacci sequence beginning 0, 29.

0, 29, 29, 58, 87, 145, 232, 377, 609, 986, 1595, 2581, 4176, 6757, 10933, 17690, 28623, 46313, 74936, 121249, 196185, 317434, 513619, 831053, 1344672, 2175725, 3520397, 5696122, 9216519, 14912641, 24129160, 39041801, 63170961, 102212762, 165383723

Offset: 0

Author

N. J. A. Sloane

Keywords

• nonn
• easy

Links

• G. C. Greubel, Table of n, a(n) for n = 0..1000
• Tanya Khovanova, Recursive Sequences
• Index entries for linear recurrences with constant coefficients, signature (1, 1).

Crossrefs

Cf. A000045.

Cf. similar sequences listed in A258160.

Programs

Magma

[29*Fibonacci(n): n in [0..40]]; // Bruno Berselli, May 22 2015

Mathematica

Table[29 Fibonacci(n), {n, 0, 40}] (* Bruno Berselli, May 22 2015 *)
LinearRecurrence[{1,1},{0,29},40] (* Harvey P. Dale, Feb 13 2023 *)

PARI

for(n=0,50, print1(29*fibonacci(n), ", ")) \\ G. C. Greubel, Aug 26 2017

Formula

G.f.: 29*x/(1-x-x^2). - Philippe Deléham, Nov 20 2008

a(n) = Fibonacci(n+7) - Fibonacci(n-7), where Fibonacci(-7..-1) = 13, -8, 5, -3, 2, -1, 1. - Bruno Berselli, May 22 2015

a(n) = a(n-1) + a(n-2) for n>=2, with a(0)=0, a(1)=29. - Wesley Ivan Hurt, May 12 2023

Extensions

More terms from Bruno Berselli, May 22 2015