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!)
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

%I #4 Feb 10 2018 09:50:01

%S 1,2,3,11,20,53,95,188,323,617,1046,1853,3089,5318,8783,14747,24176,

%T 40157,65567,107816,175475,286997,466178,759353,1231709,2001698,

%U 3244043,5263307,8524916,13817717,22372127,36238196,58658675,94977185,153716174,248824493

%N a(n) = a(n-1) + a(n-2) + 2 a(ceiling(n/2)), where a(0) = 1, a(1) = 2, a(2) = 3.

%C 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.

%H Clark Kimberling, <a href="/A298351/b298351.txt">Table of n, a(n) for n = 0..1000</a>

%t a[0] = 1; a[1] = 2; a[2] = 3;

%t a[n_] := a[n] = a[n - 1] + a[n - 2] + a[Ceiling[n/2]];

%t Table[a[n], {n, 0, 30}] (* A298351 *)

%Y Cf. A001622, A000045, A298338.

%K nonn,easy

%O 0,2

%A _Clark Kimberling_, Feb 10 2018

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 28 07:48 EDT 2024. Contains 371235 sequences. (Running on oeis4.)