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.

A105551 Number of distinct prime factors of n^3 + n^2 + 71.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 2, 1, 1, 1, 1, 3, 2, 2, 2, 2, 1, 3, 3, 2, 1, 2, 1, 1, 3, 2, 3, 1, 2, 1, 1, 3, 2, 1, 2, 3, 2, 2, 2, 1, 3, 1, 1, 3, 2, 1, 2
Offset: 0

Views

Author

Jonathan Vos Post, May 03 2005

Keywords

Comments

This cubic equation with small positive coefficients is strangely rich in primes and semiprimes. The first 44 consecutive values, for n = 0, 1, 2, ..., 43, are all either prime (23 of them) or semiprime (21 of them), before the first 3-almost prime value is encountered.

Examples

			a(0) = 1 because 0^3 + 0^2 + 71 = 71 is prime.
a(1) = 1 because 1^3 + 1^2 + 71 = 73 is prime.
a(2) = 1 because 2^3 + 2^2 + 71 = 83 is prime.
a(3) = 1 because 3^3 + 3^2 + 71 = 107 is prime.
a(4) = 1 because 3^3 + 3^2 + 71 = 151 is prime.
a(5) = 2 because 3^3 + 3^2 + 71 = 221 = 13 * 17 is the first semiprime.
a(44) = 3 because 44^3 + 44^2 + 71 = 87191 = 13 * 19 * 353 is the first 3-almost prime for nonnegative integers n.
		

Crossrefs

Programs

Formula

a(n) = A001221(n^3 + n^2 + 71).

Extensions

More terms from Robert G. Wilson v, May 21 2005