cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A271606 Number of numbers k such that sigma_e(k) = n for some e > 0.

Original entry on oeis.org

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

Views

Author

Keywords

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.

Examples

			a(28) = 2 because 28 = sigma_1(12) = 1+2+3+4+6+12 and also 28 = sigma_3(3) = 1^3+3^3.
		

Crossrefs

Programs

  • 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