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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A298351 a(n) = a(n-1) + a(n-2) + 2 a(ceiling(n/2)), where a(0) = 1, a(1) = 2, a(2) = 3. 2
 1, 2, 3, 11, 20, 53, 95, 188, 323, 617, 1046, 1853, 3089, 5318, 8783, 14747, 24176, 40157, 65567, 107816, 175475, 286997, 466178, 759353, 1231709, 2001698, 3244043, 5263307, 8524916, 13817717, 22372127, 36238196, 58658675, 94977185, 153716174, 248824493 (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 Clark Kimberling, Table of n, a(n) for n = 0..1000 MATHEMATICA a[0] = 1; a[1] = 2; a[2] = 3; a[n_] := a[n] = a[n - 1] + a[n - 2] + a[Ceiling[n/2]]; Table[a[n], {n, 0, 30}]  (* A298351 *) CROSSREFS Cf. A001622, A000045, A298338. Sequence in context: A291633 A004687 A097895 * A023182 A302310 A295958 Adjacent sequences:  A298348 A298349 A298350 * A298352 A298353 A298354 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 27 03:09 EST 2022. Contains 350601 sequences. (Running on oeis4.)