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!)
A244964 Number of distinct generalized pentagonal numbers dividing n. 1
1, 2, 1, 2, 2, 2, 2, 2, 1, 3, 1, 3, 1, 3, 3, 2, 1, 2, 1, 3, 2, 3, 1, 3, 2, 3, 1, 3, 1, 4, 1, 2, 1, 2, 4, 3, 1, 2, 1, 4, 1, 3, 1, 3, 3, 2, 1, 3, 2, 3, 2, 3, 1, 2, 2, 3, 2, 2, 1, 5, 1, 2, 2, 2, 2, 3, 1, 2, 1, 6, 1, 3, 1, 2, 3, 2, 3, 3, 1, 4, 1, 2, 1, 4, 2, 2, 1, 3, 1, 4, 2, 3, 1, 2, 2, 3, 1, 3, 1, 4, 1, 3, 1, 3, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
For more information about the generalized pentagonal numbers see A001318.
LINKS
FORMULA
From Amiram Eldar, Dec 31 2023: (Start)
a(n) = Sum_{d|n} A080995(d).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 6 - 2*Pi/sqrt(3) = 2.372401... . (End)
EXAMPLE
For n = 10 the generalized pentagonal numbers <= 10 are [0, 1, 2, 5, 7]. There are three generalized pentagonal numbers that divide 10; they are [1, 2, 5], so a(10) = 3.
MATHEMATICA
a[n_] := DivisorSum[n, 1 &, IntegerQ[Sqrt[24*# + 1]] &]; Array[a, 100] (* Amiram Eldar, Dec 31 2023 *)
PROG
(PARI) a(n) = sumdiv(n, d, issquare(24*d + 1)); \\ Amiram Eldar, Dec 31 2023
CROSSREFS
Sequence in context: A342510 A298071 A246920 * A096993 A297774 A043533
KEYWORD
nonn
AUTHOR
Omar E. Pol, Jul 10 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 18 06:24 EDT 2024. Contains 371769 sequences. (Running on oeis4.)