login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A347156
Sum of squares of distinct prime divisors of n that are < sqrt(n).
2
0, 0, 0, 0, 0, 4, 0, 4, 0, 4, 0, 13, 0, 4, 9, 4, 0, 13, 0, 4, 9, 4, 0, 13, 0, 4, 9, 4, 0, 38, 0, 4, 9, 4, 25, 13, 0, 4, 9, 29, 0, 13, 0, 4, 34, 4, 0, 13, 0, 29, 9, 4, 0, 13, 25, 53, 9, 4, 0, 38, 0, 4, 58, 4, 25, 13, 0, 4, 9, 78, 0, 13, 0, 4, 34, 4, 49, 13, 0, 29
OFFSET
1,6
FORMULA
G.f.: Sum_{k>=1} prime(k)^2 * x^(prime(k)*(prime(k) + 1)) / (1 - x^prime(k)).
MATHEMATICA
Table[DivisorSum[n, #^2 &, # < Sqrt[n] && PrimeQ[#] &], {n, 1, 80}]
nmax = 80; CoefficientList[Series[Sum[Prime[k]^2 x^(Prime[k] (Prime[k] + 1))/(1 - x^Prime[k]), {k, 1, nmax}], {x, 0, nmax}], x] // Rest
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Aug 20 2021
STATUS
approved