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!)
A007730 7th binary partition function. 2

%I #30 Feb 20 2021 03:35:58

%S 1,1,2,2,4,4,6,5,9,8,12,10,16,14,19,15,24,20,28,22,34,29,39,30,46,38,

%T 52,40,59,49,64,48,72,58,78,59,87,72,94,70,104,84,113,85,124,102,132,

%U 98,144,115,153,114,166,136,176,130,189,151,200,148,212,172,220

%N 7th binary partition function.

%H Alois P. Heinz, <a href="/A007730/b007730.txt">Table of n, a(n) for n = 0..10000</a>

%H B. Reznick, <a href="http://dx.doi.org/10.1007/978-1-4612-3464-7_29">Some binary partition functions</a>, in "Analytic number theory" (Conf. in honor P. T. Bateman, Allerton Park, IL, 1989), 451-477, Progr. Math., 85, Birkhäuser Boston, Boston, MA, 1990.

%F G.f.: Product_{k>=0} (1 - x^(7*2^k))/(1 - x^(2^k)). - _Ilya Gutkovskiy_, Jul 09 2019

%p b:= proc(n, i) option remember;

%p `if`(n=0, 1, `if`(i<0, 0, add(`if`(n-j*2^i<0, 0,

%p b(n-j*2^i, i-1)), j=0..6)))

%p end:

%p a:= n-> b(n, ilog2(n)):

%p seq(a(n), n=0..70); # _Alois P. Heinz_, Jun 21 2012

%t b[n_, i_, k_] := b[n, i, k] = If[n == 0, 1, If[i < 0, 0,

%t Sum[If[n-j*2^i < 0, 0, b[n-j*2^i, i-1, k]], {j, 0, k-1}]]];

%t a[n_] := b[n, Length[IntegerDigits[n, 2]] - 1, 7];

%t Table[a[n], {n, 0, 70} ] (* _Jean-François Alcover_, Jan 17 2014, after _Alois P. Heinz_ *)

%Y A column of A072170.

%K nonn

%O 0,3

%A _N. J. A. Sloane_

%E More terms from _Vladeta Jovovic_, May 07 2004

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 April 25 06:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)