|
|
A363194
|
|
Number of divisors of the n-th powerful number A001694(n).
|
|
6
|
|
|
1, 3, 4, 3, 5, 3, 4, 6, 9, 3, 7, 12, 5, 9, 12, 3, 4, 8, 15, 3, 9, 12, 16, 9, 6, 9, 18, 3, 15, 4, 3, 12, 15, 20, 9, 9, 12, 10, 3, 21, 5, 20, 12, 9, 7, 15, 18, 3, 24, 27, 3, 12, 18, 16, 11, 9, 12, 24, 9, 9, 25, 12, 4, 12, 3, 12, 9, 9, 18, 21, 3, 28, 27, 36, 3, 15
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
Sum_{a(k) < x} a(k) = c_1 * sqrt(x) * log(x)^2 + c_2 * sqrt(x) * log(x) + c_3 * sqrt(x) + O(x^(5/12 + eps)), where c_1, c_2 and c_3 are constants. c_1 = Product_{p prime} (1 + 4/p^(3/2) - 1/p^2 - 6/p^(5/2) + 2/p^(7/2))/8 = 0.516273682988566836609... .
|
|
MATHEMATICA
|
DivisorSigma[0, Select[Range[3000], # == 1 || Min[FactorInteger[#][[;; , 2]]] > 1 &]]
|
|
PROG
|
(PARI) apply(numdiv, select(ispowerful, [1..3000]))
(Python)
from itertools import count, islice
from math import prod
from sympy import factorint
def A363194_gen(): # generator of terms
for n in count(1):
f = factorint(n).values()
if all(e>1 for e in f):
yield prod(e+1 for e in f)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|