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!)
A140473 a(n) = a(floor(2*n/3)) + a(floor(n/3)), a(0) = 0, a(1) = 1. 1
0, 1, 1, 2, 2, 3, 3, 3, 4, 5, 5, 5, 6, 6, 7, 8, 8, 8, 9, 9, 9, 10, 10, 11, 12, 12, 12, 14, 14, 14, 14, 14, 15, 15, 15, 16, 18, 18, 18, 18, 18, 20, 21, 21, 21, 22, 22, 22, 23, 23, 23, 23, 23, 24, 27, 27, 27, 27, 27, 27, 27, 27, 29, 31, 31, 31, 31, 31, 32, 33, 33, 33, 35, 35, 35, 35 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
MATHEMATICA
a[0] = 0; a[1] = 1;
a[n_] := a[n] = a[Floor[2*n/3]] + a[Floor[n/3]];
Table[a[n], {n, 0, 200}]
CROSSREFS
Sequence in context: A354967 A125186 A226222 * A115384 A131411 A300068
KEYWORD
nonn,easy
AUTHOR
STATUS
approved

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 April 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)