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

A271606
Number of numbers k such that sigma_e(k) = n for some e > 0.
2
1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 2, 1, 1, 1, 0, 1, 2, 0, 1, 1, 0, 0, 3, 0, 1, 0, 2, 0, 1, 2, 2, 1, 0, 0, 1, 0, 1, 1, 1, 0, 3, 0, 1, 0, 0, 0, 3, 0, 2, 0, 0, 0, 2, 0, 2, 1, 0, 0, 3, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 5, 1, 1, 0, 0, 0, 1, 0, 2, 0, 1, 0, 3, 1, 0, 0, 0, 0, 3, 2, 0, 1, 0, 0, 4, 0, 2, 0, 0
OFFSET
1,12
COMMENTS
We can't just define this as number of pairs k, e with e > 0 that have sigma_e(k) = n, because sigma_e(1) = 1 for all e.
LINKS
EXAMPLE
a(28) = 2 because 28 = sigma_1(12) = 1+2+3+4+6+12 and also 28 = sigma_3(3) = 1^3+3^3.
PROG
(PARI) alist(n)=my(r=vector(n), s); r[1]=1; for(k=2, n, e=1; while((s=sigma(k, e))<=n, r[s]++; e++)); r
CROSSREFS
Sequence in context: A345416 A321755 A052314 * A093718 A278839 A348653
KEYWORD
nonn
AUTHOR
STATUS
approved