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!)
 A298347 a(n) = a(n-1) + a(n-2) + 2 a([n/2]), where a(0) = 1, a(1) = 2, a(2) = 3. 2
 1, 2, 3, 9, 18, 33, 69, 120, 225, 381, 672, 1119, 1929, 3186, 5355, 8781, 14586, 23817, 39165, 63744, 104253, 169341, 275832, 447411, 727101, 1178370, 1911843, 3096585, 5019138, 8126433, 13163133, 21307128, 34499433, 55835733, 90382800, 146266167, 236727297 (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] + 2 a[Floor[n/2]]; Table[a[n], {n, 0, 30}]  (* A298347 *) CROSSREFS Cf. A001622, A000045, A298338. Sequence in context: A065965 A296052 A108827 * A113201 A089753 A094679 Adjacent sequences:  A298344 A298345 A298346 * A298348 A298349 A298350 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 August 8 19:29 EDT 2020. Contains 336298 sequences. (Running on oeis4.)