cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A066350 Bisection of A007059.

This page as a plain text file.
%I A066350 #14 Nov 17 2020 11:07:49
%S A066350 0,1,3,8,24,77,256,874,3045,10780,38674,140268,513350,1892875,7023562,
%T A066350 26200182,98182666,369393466,1394632365,5281753216,20058841004,
%U A066350 76370762838,291436246116,1114474774102,4270050059100,16389518073023,63010289558056,242614318886286
%N A066350 Bisection of A007059.
%H A066350 Alois P. Heinz, <a href="/A066350/b066350.txt">Table of n, a(n) for n = 0..500</a>
%p A066350 b:= proc(n, m) option remember; `if`(n=0, 1,
%p A066350       `if`(m=0, add(b(n-j, j), j=1..n),
%p A066350       add(b(n-j, min(n-j, m)), j=1..min(n, m))))
%p A066350     end:
%p A066350 a:= n-> b(2*n-1, 0):
%p A066350 seq(a(n), n=0..40);  # _Alois P. Heinz_, Dec 19 2014
%t A066350 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 A066350 a[n_] := b[2n-1, 0];
%t A066350 a /@ Range[0, 40] (* _Jean-François Alcover_, Nov 17 2020, after _Alois P. Heinz_ *)
%Y A066350 Cf. A007059, A066351.
%K A066350 nonn,easy
%O A066350 0,3
%A A066350 _N. J. A. Sloane_, Dec 19 2001
%E A066350 More terms from _Joshua Zucker_, May 12 2006