The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066350 Bisection of A007059. 1


%S 0,1,3,8,24,77,256,874,3045,10780,38674,140268,513350,1892875,7023562,

%T 26200182,98182666,369393466,1394632365,5281753216,20058841004,

%U 76370762838,291436246116,1114474774102,4270050059100,16389518073023,63010289558056,242614318886286

%N Bisection of A007059.

%H Alois P. Heinz, <a href="/A066350/b066350.txt">Table of n, a(n) for n = 0..500</a>

%p b:= proc(n, m) option remember; `if`(n=0, 1,

%p `if`(m=0, add(b(n-j, j), j=1..n),

%p add(b(n-j, min(n-j, m)), j=1..min(n, m))))

%p end:

%p a:= n-> b(2*n-1, 0):

%p seq(a(n), n=0..40); # _Alois P. Heinz_, Dec 19 2014

%t b[n_, m_] := b[n, m] = If[n == 0, 1, If[m == 0, Sum[b[n-j, j], {j, 1, n}], Sum[b[n-j, Min[n-j, m]], {j, 1, Min[n, m]}]]];

%t a[n_] := b[2n-1, 0];

%t a /@ Range[0, 40] (* _Jean-François Alcover_, Nov 17 2020, after _Alois P. Heinz_ *)

%Y Cf. A007059, A066351.

%K nonn,easy

%O 0,3

%A _N. J. A. Sloane_, Dec 19 2001

%E More terms from _Joshua Zucker_, May 12 2006

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 5 12:24 EST 2021. Contains 349557 sequences. (Running on oeis4.)