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!)
A298412 a(n) = 2*a(n-1) + a(n-2) + a([n/2]), where a(0) = 1, a(1) = 1, a(2) = 1. 1

%I #5 Feb 11 2018 10:52:40

%S 1,1,1,4,10,25,64,157,388,943,2299,5566,13495,32620,78892,190561,

%T 460402,1111753,2684851,6482398,15651946,37788589,91234690,220263535,

%U 531775255,1283827540,3099462955,7482786070,18065113987,43613092936,105291490420,254196264337

%N a(n) = 2*a(n-1) + a(n-2) + a([n/2]), where a(0) = 1, a(1) = 1, a(2) = 1.

%C a(n)/a(n-1) -> 1 + sqrt(2).

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

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

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

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

%Y Cf. A298338.

%K nonn,easy

%O 0,4

%A _Clark Kimberling_, Feb 11 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 September 6 17:59 EDT 2024. Contains 375718 sequences. (Running on oeis4.)