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!)
A338649 Number of divisors of n which are greater than 5. 8
0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 2, 2, 1, 4, 1, 2, 2, 3, 1, 4, 1, 3, 2, 2, 2, 5, 1, 2, 2, 4, 1, 5, 1, 3, 3, 2, 1, 6, 2, 3, 2, 3, 1, 5, 2, 5, 2, 2, 1, 7, 1, 2, 4, 4, 2, 5, 1, 3, 2, 5, 1, 8, 1, 2, 3, 3, 3, 5, 1, 6, 3, 2, 1, 8, 2, 2, 2, 5, 1, 8, 3, 3, 2, 2, 2, 8, 1, 4, 4, 5, 1, 5, 1, 5, 5, 2, 1, 8, 1, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,12
LINKS
FORMULA
G.f.: Sum_{k>=1} x^(6*k) / (1 - x^k).
L.g.f.: -log( Product_{k>=6} (1 - x^k)^(1/k) ).
G.f.: Sum_{k>=6} x^k/(1 - x^k). - Seiichi Manyama, Jan 07 2023
Sum_{k=1..n} a(k) ~ n * (log(n) + 2*gamma - 197/60), where gamma is Euler's constant (A001620). - Amiram Eldar, Jan 08 2024
MATHEMATICA
Table[DivisorSum[n, 1 &, # > 5 &], {n, 1, 110}]
nmax = 110; CoefficientList[Series[Sum[x^(6 k)/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x] // Drop[#, 1] &
nmax = 110; CoefficientList[Series[-Log[Product[(1 - x^k)^(1/k), {k, 6, nmax}]], {x, 0, nmax}], x] Range[0, nmax] // Drop[#, 1] &
PROG
(PARI) a(n) = sumdiv(n, d, d>5); \\ Michel Marcus, Apr 22 2021
(PARI) my(N=100, x='x+O('x^N)); concat([0, 0, 0, 0, 0], Vec(sum(k=6, N, x^k/(1-x^k)))) \\ Seiichi Manyama, Jan 07 2023
CROSSREFS
Column k=6 of A135539.
Sequence in context: A045778 A320889 A296133 * A337176 A033103 A245661
KEYWORD
nonn,easy
AUTHOR
Ilya Gutkovskiy, Apr 22 2021
EXTENSIONS
a(1)-a(5) prepended by David A. Corneth, Jun 13 2022
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 23:40 EDT 2024. Contains 371798 sequences. (Running on oeis4.)