Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A143092
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A143092 Chaotic sequence: f(n) = f(Floor[2*n/3]) + f(f(Floor[n/3])). +0
1
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; listen)
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 this_sequence A143089 A161857 A135533

Adjacent sequences: A143089 A143090 A143091 this_sequence A143093 A143094 A143095

KEYWORD

nonn,uned

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research