login
This site is supported by donations 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
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, 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, 42, 32, 6, 8, 20, 6, 48, 12, 16, 28, 8, 2, 12, 20, 16, 12, 4, 32 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

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

LINKS

Giovanni Resta, Table of n, a(n) for n = 0..10000

FORMULA

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

MATHEMATICA

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

PROG

(PARI) a(n) = numdiv(polcoeff(prod(k=1, n, 1 + x^k, 1 + x * O(x^n)), n)); \\ Michel Marcus, Jun 19 2015

CROSSREFS

Cf. A000009, A085543.

Sequence in context: A286545 A046798 A157231 * A273784 A318058 A305434

Adjacent sequences:  A258593 A258594 A258595 * A258597 A258598 A258599

KEYWORD

nonn

AUTHOR

Giovanni Resta, Jun 04 2015

STATUS

approved

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 September 17 06:00 EDT 2019. Contains 327119 sequences. (Running on oeis4.)