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.

Showing 1-1 of 1 results.

A071215 Number of distinct prime factors of sum of 2 successive primes.

Original entry on oeis.org

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

Views

Author

Labos Elemer, May 17 2002

Keywords

Examples

			Prime(6) = 13 and prime(7) = 17. 13 + 17 = 30 = 2 * 3 * 5, which has three distinct prime factors, hence a(6) = 3.
		

Crossrefs

Cf. A001043, A001221, A071216, A251609 (greedy inverse).

Programs

Formula

a(n) = omega(prime(n) + prime(n + 1)) = A001221(A001043(n)), where omega is the number of distinct prime factors function.
Showing 1-1 of 1 results.