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!)
A258596 Number of divisors of the number of partitions of n into distinct parts, a(n) = A000005(A000009(n)). 1

%I #11 Jun 19 2015 07:01:50

%S 1,1,1,2,2,2,3,2,4,4,4,6,4,6,4,4,6,4,4,8,7,6,2,8,4,4,8,14,8,9,8,12,16,

%T 14,10,12,6,16,24,4,8,36,8,16,8,12,27,16,16,28,8,4,8,22,8,8,6,16,16,

%U 42,32,6,8,20,6,48,12,16,28,8,2,12,20,16,12,4,32

%N Number of divisors of the number of partitions of n into distinct parts, a(n) = A000005(A000009(n)).

%C a(n) is odd for n = 0, 1, 2, 6, 20, 29, 46, ... ; see A035142. - _Michel Marcus_, Jun 19 2015

%H Giovanni Resta, <a href="/A258596/b258596.txt">Table of n, a(n) for n = 0..10000</a>

%F a(n) = A000005(A000009(n)).

%t DivisorSigma[0, PartitionsQ@ Range[0, 100]]

%o (PARI) a(n) = numdiv(polcoeff(prod(k=1, n, 1 + x^k, 1 + x * O(x^n)), n)); \\ _Michel Marcus_, Jun 19 2015

%Y Cf. A000009, A085543.

%K nonn

%O 0,4

%A _Giovanni Resta_, Jun 04 2015

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 27 21:44 EDT 2024. Contains 372020 sequences. (Running on oeis4.)