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.

A046053 Total number of prime factors of the repunit R(n) = (10^n-1)/9.

Original entry on oeis.org

0, 1, 2, 2, 2, 5, 2, 4, 4, 4, 2, 7, 3, 4, 6, 6, 2, 9, 1, 7, 7, 7, 1, 10, 5, 6, 7, 8, 5, 13, 3, 11, 6, 6, 7, 12, 3, 3, 6, 11, 4, 15, 4, 11, 10, 6, 2, 13, 4, 10, 8, 9, 4, 14, 8, 12, 6, 8, 2, 20, 7, 5, 14, 15, 7, 15, 3, 10, 6, 12, 2, 18, 3, 7, 12, 6, 8, 16, 6, 15, 13, 7, 3, 22, 7, 8, 10, 15, 5
Offset: 1

Views

Author

Keywords

Examples

			R(6) = 111111 = (3) (7) (11) (13) (37), so a(6) = 5.
		

Crossrefs

Cf. A001222, A002275, A057951. For the number of distinct prime factors see A095370.

Programs

Formula

a(n) = A001222(A002275(n)). - Ray Chandler, Apr 22 2017
a(n) = A057951(n) - 2. - Ray Chandler, Apr 24 2017