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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A116591 a(0)=1; a(n) = b(n+2) + b(n), where b(n) = A005229(n) is the sequence defined by b(1) = b(2) = 1, b(n) = b(b(n-2)) + b(n-b(n-2)) for n>2. 2
 1, 3, 4, 5, 7, 8, 10, 11, 13, 13, 15, 16, 18, 19, 21, 22, 23, 25, 26, 28, 30, 31, 33, 33, 35, 36, 37, 39, 39, 41, 42, 44, 46, 47, 49, 50, 51, 53, 54, 56, 57, 59, 59, 60, 61, 62, 64, 66, 68, 70, 71, 73, 73, 75, 76, 77, 79, 80, 82, 84, 85, 87, 88, 89, 90, 91, 91, 93, 94, 96, 98 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS A similar definition applied to the Fibonacci sequence (A000045) leads to the Lucas sequence (A000032). LINKS G. C. Greubel, Table of n, a(n) for n = 0..5000 FORMULA a(n) = A005229(n+2) + A005229(n) for n>=1. MAPLE b:=proc(n) option remember; if n<=2 then 1 else b(b(n-2))+b(n-b(n-2)): fi: end: seq(b(n), n=1..75): a[0]:=1: for n from 1 to 70 do a[n]:=b(n)+b(n+2) od: seq(a[n], n=0..70); MATHEMATICA M[0] = 0; M[1] = M[2] = 1; M[n_Integer?Positive] := M[n] = M[M[n - 2]] + M[n - M[n - 2]] L[0] = 1; L[n_] := L[n] = M[n - 1] + M[n + 1] Table[L[n], {n, 1, 200}] CROSSREFS Cf. A000032, A005185, A005229. Sequence in context: A047367 A184620 A039043 * A136119 A184618 A110882 Adjacent sequences:  A116588 A116589 A116590 * A116592 A116593 A116594 KEYWORD nonn AUTHOR Roger L. Bagula, Mar 27 2006 EXTENSIONS Edited by N. J. A. Sloane, Apr 15 2006 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.

Last modified September 22 06:08 EDT 2020. Contains 337289 sequences. (Running on oeis4.)