login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098965 Number of partitions of n into distinct parts >1, each of which has a part which divides every part in the partition. 0
0, 1, 1, 1, 1, 2, 1, 2, 2, 2, 1, 5, 1, 3, 3, 5, 1, 7, 1, 8, 4, 6, 1, 15, 2, 9, 5, 14, 1, 22, 1, 20, 7, 18, 4, 36, 1, 26, 10, 40, 1, 51, 1, 48, 18, 49, 1, 86, 3, 73, 19, 86, 1, 117, 7, 120, 27, 120, 1, 196, 1, 160, 42, 201, 10, 259, 1, 258, 50, 292, 1, 407, 1, 357, 81, 431, 8, 548, 1, 577 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

Table of n, a(n) for n=1..80.

FORMULA

a(n) = Sum_{d|n, d<n} A025147(d-1).

G.f.: Sum_{k>=2} (x^k*Product_{i>=2}(1 + x^(k*i))).

MATHEMATICA

Take[ CoefficientList[ Expand[ Sum[x^k*Product[1 + x^(k*i), {i, 2, 92}], {k, 2, 92}]], x], {2, 81}] (* Robert G. Wilson v, Nov 01 2004 *)

CROSSREFS

Cf. A083710, A083711.

Sequence in context: A324114 A011776 A297791 * A290087 A016443 A327640

Adjacent sequences:  A098962 A098963 A098964 * A098966 A098967 A098968

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic, Oct 23 2004

EXTENSIONS

More terms from Robert G. Wilson v, Nov 01 2004

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 August 6 15:44 EDT 2020. Contains 336254 sequences. (Running on oeis4.)