Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A143091
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A143091 Chaotic sequence: f(n) = f(Floor[2*n/3]) + f(Floor[n/3]). +0
2
1, 1, 2, 3, 3, 4, 5, 5, 6, 8, 8, 8, 9, 9, 11, 12, 12, 12, 14, 14, 14, 16, 16, 17, 18, 18, 18, 22, 22, 22, 22, 22, 24, 24, 24, 25, 27, 27, 27, 27, 27, 31, 33, 33, 33, 34, 34, 34, 36, 36, 36, 36, 36, 37, 41, 41, 41, 41, 41, 41, 41, 41, 45, 49, 49, 49, 49, 49, 50, 51, 51, 51, 54, 54 (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] (*fractal noise chaotic sequence*) f[0] = 1; f[1] = 0; f[1] = 1; f[n_] := f[n] = f[n - f[n - 1]] + f[Floor[2*n/3]] (*Cantor like fractal stair step chaotic sequence*) g[0] = 1; g[1] = 0; g[1] = 1; g[n_] := g[n] = g[Floor[2*n/3]] + g[Floor[n/3]]; ListPlot[Table[{f[n], g[n]}, {n, 0, 200}], PlotJoined -> True]; Table[g[n], {n, 0, 200}]

CROSSREFS

Adjacent sequences: A143088 A143089 A143090 this_sequence A143092 A143093 A143094

Sequence in context: A076874 A127041 A127039 this_sequence A114539 A007998 A029931

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 January 7 11:41 EST 2009. Contains 152824 sequences.


AT&T Labs Research