The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A022363 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A022363

Fibonacci sequence beginning 0, 29.
(history; published version)

#27 by Wesley Ivan Hurt at Fri May 12 15:03:00 EDT 2023

STATUS

editing

approved

#26 by Wesley Ivan Hurt at Fri May 12 15:02:57 EDT 2023

FORMULA

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

STATUS

approved

editing

#25 by Harvey P. Dale at Mon Feb 13 16:34:37 EST 2023

STATUS

editing

approved

#24 by Harvey P. Dale at Mon Feb 13 16:34:34 EST 2023

MATHEMATICA

LinearRecurrence[{1, 1}, {0, 29}, 40] (* Harvey P. Dale, Feb 13 2023 *)

STATUS

approved

editing

#23 by Charles R Greathouse IV at Thu Sep 08 08:44:46 EDT 2022

PROG

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

Discussion

Thu Sep 08

08:44

OEIS Server: https://oeis.org/edit/global/2944

#22 by Alois P. Heinz at Sat Aug 26 20:10:57 EDT 2017

STATUS

proposed

approved

#21 by G. C. Greubel at Sat Aug 26 19:36:12 EDT 2017

STATUS

editing

proposed

#20 by G. C. Greubel at Sat Aug 26 19:36:06 EDT 2017

LINKS

G. C. Greubel, <a href="/A022363/b022363.txt">Table of n, a(n) for n = 0..1000</a>

FORMULA

a(n) = Fibonacci(n+7) - Fibonacci(n-7), where Fibonacci(-7..-1) = 13, -8, 5, -3, 2, -1, 1. [_- _Bruno Berselli_, May 22 2015]

PROG

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

STATUS

approved

editing

#19 by Ray Chandler at Thu Jul 30 17:50:30 EDT 2015

STATUS

editing

approved

#18 by Ray Chandler at Thu Jul 30 17:50:27 EDT 2015

LINKS

<a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1).

STATUS

approved

editing