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!)
A143091 a(n) = a(floor(2n/3)) + a(floor(n/3)) starting a(0)=a(1)=1. 2

%I #6 Jul 12 2012 08:35:10

%S 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,

%T 22,22,22,22,22,24,24,24,25,27,27,27,27,27,31,33,33,33,34,34,34,36,36,

%U 36,36,36,37,41,41,41,41,41,41,41,41,45,49,49,49,49,49,50,51,51,51,54,54

%N a(n) = a(floor(2n/3)) + a(floor(n/3)) starting a(0)=a(1)=1.

%p A143091 := proc(n)

%p option remember;

%p if n <=1 then

%p 1;

%p else

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

%p end if;

%p end proc: # _R. J. Mathar_, Jul 12 2012

%t 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}]

%K nonn

%O 0,3

%A _Roger L. Bagula_, Oct 16 2008

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 July 13 06:34 EDT 2024. Contains 374267 sequences. (Running on oeis4.)