The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A047966 a(n) = Sum_{ d divides n } q(d), where q(d) = A000009 = number of partitions of d into distinct parts. 126

%I #36 Oct 27 2023 19:19:37

%S 1,2,3,4,4,8,6,10,11,15,13,25,19,29,33,42,39,62,55,81,84,103,105,153,

%T 146,185,203,253,257,344,341,432,463,552,594,747,761,920,1003,1200,

%U 1261,1537,1611,1921,2089,2410,2591,3095,3270,3815,4138,4769,5121,5972,6394,7367,7974,9066,9793,11305,12077,13736,14940

%N a(n) = Sum_{ d divides n } q(d), where q(d) = A000009 = number of partitions of d into distinct parts.

%C Number of partitions of n such that every part occurs with the same multiplicity. - _Vladeta Jovovic_, Oct 22 2004

%C Christopher and Christober call such partitions uniform. - _Gus Wiseman_, Apr 16 2018

%C Equals inverse Mobius transform (A051731) * A000009, where the latter begins (1, 1, 2, 2, 3, 4, 5, 6, 8, ...). - _Gary W. Adamson_, Jun 08 2009

%H Alois P. Heinz, <a href="/A047966/b047966.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from T. D. Noe)

%H A. David Christopher and M. Davamani Christober, <a href="http://emis.impa.br/EMIS/journals/GMN/yahoo_site_admin/assets/docs/1_GMN-2492-V13N2.77213831.pdf">Relatively Prime Uniform Partitions</a>, Gen. Math. Notes, Vol. 13, No. 2, December, 2012, pp.1-12.

%F G.f.: Sum_{k>0} (-1+Product_{i>0} (1+z^(k*i))). - _Vladeta Jovovic_, Jun 22 2003

%F G.f.: Sum_{k>=1} q(k)*x^k/(1 - x^k), where q() = A000009. - _Ilya Gutkovskiy_, Jun 20 2018

%F a(n) ~ exp(Pi*sqrt(n/3)) / (4*3^(1/4)*n^(3/4)). - _Vaclav Kotesovec_, Aug 27 2018

%e The a(6) = 8 uniform partitions are (6), (51), (42), (33), (321), (222), (2211), (111111). - _Gus Wiseman_, Apr 16 2018

%p with(numtheory):

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

%p `if`(d::odd, d, 0), d=divisors(j))*b(n-j), j=1..n)/n)

%p end:

%p a:= n-> add(b(d), d=divisors(n)):

%p seq(a(n), n=1..100); # _Alois P. Heinz_, Jul 11 2016

%t b[n_] := b[n] = If[n==0, 1, Sum[DivisorSum[j, If[OddQ[#], #, 0]&]*b[n-j], {j, 1, n}]/n]; a[n_] := DivisorSum[n, b]; Table[a[n], {n, 1, 100}] (* _Jean-François Alcover_, Dec 06 2016 after _Alois P. Heinz_ *)

%t Table[DivisorSum[n,PartitionsQ],{n,20}] (* _Gus Wiseman_, Apr 16 2018 *)

%o (PARI)

%o N = 66; q='q+O('q^N);

%o D(q)=eta(q^2)/eta(q); \\ A000009

%o Vec( sum(e=1,N,D(q^e)-1) ) \\ _Joerg Arndt_, Mar 27 2014

%Y Cf. A000009, A000837, A024994, A047968, A063834, A279788, A289501, A300383, A301462, A302698.

%K nonn

%O 1,2

%A _N. J. A. Sloane_

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 May 18 21:39 EDT 2024. Contains 372666 sequences. (Running on oeis4.)