login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A298355 a(n) = a(n-1) + a(n-2) + 2 a([(n-1)/2]), where a(0) = 1, a(1) = 2, a(2) = 3. 2
1, 2, 3, 9, 16, 31, 53, 102, 173, 307, 512, 881, 1455, 2442, 4003, 6649, 10856, 17851, 29053, 47518, 77185, 125727, 203936, 331425, 537123, 871458, 1411491, 2287833, 3704208, 6000047, 9712261, 15725606, 25451165, 41198483, 66671360, 107905545, 174612607 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
a(n)/a(n-1) -> (1 + sqrt(5))/2, the golden ratio (A001622), so that (a(n)) has the growth rate of the Fibonacci numbers (A000045). See A298338 for a guide to related sequences.
LINKS
MATHEMATICA
a[0] = 1; a[1] = 2; a[2] = 3;
a[n_] := a[n] = a[n - 1] + a[n - 2] + 2 a[Floor[(n-1)/2]];
Table[a[n], {n, 0, 30}] (* A298355 *)
CROSSREFS
Sequence in context: A092638 A206777 A173809 * A023147 A220123 A220125
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Feb 10 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 10:22 EDT 2024. Contains 371268 sequences. (Running on oeis4.)