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”).

A366784
Sum of even indices of distinct prime factors of n divided by 2.
1
0, 0, 1, 0, 0, 1, 2, 0, 1, 0, 0, 1, 3, 2, 1, 0, 0, 1, 4, 0, 3, 0, 0, 1, 0, 3, 1, 2, 5, 1, 0, 0, 1, 0, 2, 1, 6, 4, 4, 0, 0, 3, 7, 0, 1, 0, 0, 1, 2, 0, 1, 3, 8, 1, 0, 2, 5, 5, 0, 1, 9, 0, 3, 0, 3, 1, 0, 0, 1, 2, 10, 1, 0, 6, 1, 4, 2, 4, 11, 0, 1, 0, 0, 3, 0, 7, 6, 0, 12, 1, 5, 0, 1, 0, 4, 1, 0, 2, 1
OFFSET
1,7
FORMULA
G.f.: Sum_{k>=1} k * x^prime(2*k) / (1 - x^prime(2*k)).
EXAMPLE
a(315) = 3 because 315 = 3^2 * 5 * 7 = prime(2)^2 * prime(3) * prime(4) and (2 + 4) / 2 = 3.
MATHEMATICA
nmax = 100; CoefficientList[Series[Sum[k x^Prime[2 k]/(1 - x^Prime[2 k]), {k, 1, nmax}], {x, 0, nmax}], x] // Rest
CROSSREFS
Cf. A066208 (positions of 0's), A066328, A324967, A332422, A344931, A366533, A366725.
Sequence in context: A144628 A373832 A286604 * A217540 A226861 A185643
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Oct 24 2023
STATUS
approved