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.

A213408 Sequence A002654 with the zero terms omitted.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 3, 2, 2, 1, 2, 1, 2, 2, 2, 2, 1, 3, 2, 2, 2, 2, 1, 4, 2, 1, 2, 2, 2, 1, 2, 4, 2, 2, 2, 1, 3, 2, 2, 2, 2, 2, 2, 2, 1, 2, 4, 1, 4, 2, 2, 1, 4, 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, 2, 2, 2, 2, 4, 2, 2, 1, 2, 3, 2, 4, 2, 2, 2, 4, 3, 2, 2, 2, 2, 2, 2, 1, 2, 2, 4, 1, 2, 4, 2, 4, 2, 2, 2, 2, 2, 1, 3, 4, 2, 2, 2, 2
Offset: 1

Views

Author

N. J. A. Sloane, Jun 10 2012

Keywords

References

  • J. W. L. Glaisher, On the function which denotes the difference between the number of (4m+1)-divisors and the number of (4m+3)-divisors of a number, Proc. London Math. Soc., 15 (1884), 104-122. See Table on page 106.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

Crossrefs

Cf. A002654.