login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A298340 a(n) = a(n-1) + a(n-2) + a([n/3]), where a(0) = 1, a(1) = 1, a(2) = 1. 2

%I

%S 1,1,1,3,5,9,15,25,41,69,113,185,303,493,801,1303,2113,3425,5553,8993,

%T 14561,23579,38165,61769,99975,161785,261801,423655,685525,1109249,

%U 1794887,2904249,4699249,7603683,12303117,19906985,32210405,52117693,84328401

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

%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="/A298340/b298340.txt">Table of n, a(n) for n = 0..999</a>

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

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

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

%Y Cf. A001622, A000045, A298338.

%K nonn,easy

%O 0,4

%A _Clark Kimberling_, Feb 09 2018

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 22 22:16 EST 2020. Contains 331166 sequences. (Running on oeis4.)