login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A143092 Chaotic sequence: f(n) = f(Floor[2*n/3]) + f(f(Floor[n/3])). 0
1, 1, 2, 3, 3, 5, 4, 6, 7, 5, 8, 7, 11, 8, 9, 11, 12, 11, 13, 11, 12, 10, 16, 13, 18, 17, 12, 19, 13, 19, 18, 19, 16, 23, 19, 20, 25, 24, 20, 22, 24, 22, 20, 21, 24, 23, 26, 21, 31, 25, 30, 21, 30, 25, 36, 28, 31, 24, 31, 29, 37, 36, 28, 32, 28, 34, 34, 41, 32, 36, 31, 34, 39, 38 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

FORMULA

f(n) = f(Floor[2*n/3]) + f((Floor[n/3])).

MATHEMATICA

Clear[a, f, b, c, g]; f[0] = 1; f[1] = 0; f[1] = 1; f[n_] := f[n] = f[n - f[n - 1]] + f[f[Floor[2*n/3]]]; Table[f[n], {n, 0, 200}]

CROSSREFS

Sequence in context: A088241 A163126 A088922 * A143089 A161857 A135533

Adjacent sequences:  A143089 A143090 A143091 * A143093 A143094 A143095

KEYWORD

nonn,uned

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Oct 16 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 18:47 EST 2012. Contains 205663 sequences.