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.

A160650 a(n) = A001222(A160649(n)) = A160649(n+1) - A160649(n); where A001222(m) is the sum of prime-factorization exponents of m (or, A001222(m) is the number of primes dividing m, counted with multiplicity).

Original entry on oeis.org

1, 1, 2, 2, 3, 1, 3, 2, 1, 3, 2, 1, 4, 3, 1, 5, 1, 2, 4, 3, 1, 5, 1, 4, 2, 4, 6, 3, 1, 2, 3, 1, 5, 2, 2, 1, 4, 2, 6, 3, 3, 5, 1, 3, 3, 5, 3, 7, 4, 1, 4, 6, 4, 3, 1, 2, 6, 2, 5, 1, 3, 2, 1, 5, 2, 2, 4, 1, 2, 4, 5, 2, 3, 4, 2, 6, 3, 4, 1, 3, 1, 4, 3, 1, 3, 3, 4, 5, 1, 3, 3, 5, 1, 5, 3, 2, 5, 3, 7, 2, 4, 2, 2, 2, 1
Offset: 1

Views

Author

Leroy Quet, May 21 2009

Keywords

Crossrefs

Extensions

Extended by Ray Chandler, Jun 16 2009