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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A143091 a(n) = a(floor(2n/3)) + a(floor(n/3)) starting a(0)=a(1)=1. 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; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..73.

MAPLE

A143091 := proc(n)

        option remember;

        if n <=1 then

                1;

        else

                procname(floor(n/3))+procname(floor(2*n/3)) ;

        end if;

end proc: # R. J. Mathar, Jul 12 2012

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

Sequence in context: A127041 A173023 A127039 * A114539 A238746 A272611

Adjacent sequences:  A143088 A143089 A143090 * A143092 A143093 A143094

KEYWORD

nonn

AUTHOR

Roger L. Bagula, Oct 16 2008

STATUS

approved

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 December 14 01:27 EST 2019. Contains 329978 sequences. (Running on oeis4.)