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!)
A236103 Number of distinct partition numbers dividing n. 9
1, 2, 2, 2, 2, 3, 2, 2, 2, 3, 2, 3, 1, 3, 4, 2, 1, 3, 1, 3, 3, 4, 1, 3, 2, 2, 2, 3, 1, 6, 1, 2, 3, 2, 3, 3, 1, 2, 2, 3, 1, 5, 1, 4, 4, 2, 1, 3, 2, 3, 2, 2, 1, 3, 3, 4, 2, 2, 1, 6, 1, 2, 3, 2, 2, 5, 1, 2, 2, 4, 1, 3, 1, 2, 4, 2, 4, 3, 1, 3, 2, 2, 1, 5, 2, 2, 2, 4, 1, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
From Amiram Eldar, Jan 01 2024: (Start)
a(n) = Sum_{d|n} A167392(d).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = A078506 = 2.510597... . (End)
EXAMPLE
For n = 20 the divisors of 20 are 1, 2, 4, 5, 10, 20 and three of them are also partition numbers: 1, 2, 5, so a(20) = 3.
For n = 42 the divisors of 42 are 1, 2, 3, 6, 7, 14, 21, 42 and five of them are also partition numbers: 1, 2, 3, 7, 42, so a(42) = 5.
MATHEMATICA
p = {1}; Table[If[n >= Last@p, AppendTo[p, PartitionsP[1 + Length@p]]]; Length@Select[p, Mod[n, #] == 0 &], {n, 90}] (* Giovanni Resta, Jan 22 2014 *)
CROSSREFS
Sequence in context: A259651 A253719 A081147 * A278293 A163671 A287841
KEYWORD
nonn
AUTHOR
Omar E. Pol, Jan 21 2014
STATUS
approved

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 19 09:23 EDT 2024. Contains 371782 sequences. (Running on oeis4.)