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.

A110949 Integers n such that 4*10^n + 61 is prime.

Original entry on oeis.org

1, 2, 7, 11, 191, 248, 1067, 2666, 5252, 13400, 22886, 23739, 29095
Offset: 1

Views

Author

Julien Peter Benney (jpbenney(AT)ftml.net), Oct 04 2005

Keywords

Comments

See Kamada link - primecount.txt for terms, primesize.txt for discovery details including probable or proved primes - search on "40061".
a(14) > 10^5. - Robert Price, Jan 22 2017

Examples

			n = 7 is in the sequence because 4*10^7 + 61 = 4*10000000 + 61 = 40000000 + 61 = 40000061, which is prime.
		

Crossrefs

Programs

  • PARI
    isok(n) = isprime(4*10^n+61); \\ Michel Marcus, Jan 22 2017

Extensions

a(9)-a(11) from Ray Chandler, Dec 23 2010
Prepended a(1)=1 by Robert Price, Jan 22 2017
a(12)-a(13) from Robert Price, Jan 22 2017