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.

A014666 Erroneous version of A027435.

Original entry on oeis.org

1, 2, 4, 6, 10, 11, 17, 21, 27, 29, 39, 42, 54, 58, 63, 71, 87, 90, 108, 114, 121, 126
Offset: 1

Views

Author

Keywords

Comments

Former title: Partial sums of A014665. - Sean A. Irvine, Nov 15 2018

References

  • S. W. Golomb, personal communication, Svalbard, Norway, 7/97.

Formula

For n>1: # of positive integers u <= n(n-1) such that p^H_p(u)<=n for all p<=u, where H_p(u) = highest power of p dividing u.