login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


A279497
Number of pentagonal numbers dividing n.
3
1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 2, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 2, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 1, 3, 1, 1, 1, 1, 2, 2, 1, 1, 1, 4, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 1, 2, 1, 1, 3, 1, 1, 2, 1, 3, 1, 1, 1, 1, 2, 1, 2, 1, 1, 3
OFFSET
1,5
FORMULA
G.f.: Sum_{k>=1} x^(k*(3*k-1)/2)/(1 - x^(k*(3*k-1)/2)).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 3*log(3) - Pi/sqrt(3) = 1.482037... (A244641). - Amiram Eldar, Jan 02 2024
EXAMPLE
a(12) = 2 because 12 has 6 divisors {1,2,3,4,6,12} among which 2 divisors {1,12} are pentagonal numbers.
MATHEMATICA
Rest[CoefficientList[Series[Sum[x^(k (3k -1)/2)/(1 - x^(k (3k -1)/2)), {k, 120}], {x, 0, 120}], x]]
Table[Count[Divisors[n], _?(IntegerQ[(1+Sqrt[1+24#])/6]&)], {n, 120}] (* Harvey P. Dale, Jan 05 2022 *)
PROG
(PARI) a(n) = sumdiv(n, d, ispolygonal(d, 5)); \\ Michel Marcus, Jul 27 2022
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Ilya Gutkovskiy, Dec 13 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 21 18:35 EDT 2024. Contains 376087 sequences. (Running on oeis4.)