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.

A176090 Numbers n such that 2(10^n-1)/3 * 10^ceiling(log_10(n+1)) + n is prime.

Original entry on oeis.org

1, 7, 41, 2429
Offset: 1

Views

Author

Rick L. Shepherd, Apr 13 2010

Keywords

Comments

No term is a multiple of 2, 3, or 5. The decimal expansion of each corresponding prime (in A176272) is n 6's with n's decimal expansion concatenated. Primes and probable primes found by PrimeForm. Prime for 41 proved by Primo. No more terms up to 30000.

Examples

			The numbers 1 and 7 are terms because 61 and 66666667 are prime.
		

Crossrefs

Cf. A176272 (corresponding primes), n k's followed by n is prime: A070746 (k=1), A176087 (k=3), A176089 (k=4), A084428 (k=7), A176091 (k=9). [k=2, 5, and 8 produce only composites divisible by 3.]

Programs