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-2 of 2 results.

A230810 Smallest of 3 consecutive odd numbers that are primes or strong pseudoprime to base 2.

Original entry on oeis.org

3, 3465253618399, 374166120095639, 12959269432331237, 44202753561285409, 1640293473202755797, 1640293473202755799, 10623546148468360249
Offset: 1

Views

Author

Shyam Sunder Gupta, Oct 30 2013

Keywords

Comments

Since a(7) = a(6) + 2, the number a(6) = 1640293473202755797 actually starts a sequence of four consecutive odd numbers which are prime or strong pseudoprimes to base 2. - M. F. Hasler, Dec 08 2016

Examples

			3465253618399 is in sequence because 3465253618399, 3465253618401, 3465253618403 is a set of 3 consecutive odd number where 3465253618401 is strong pseudoprime base 2 and others are prime.
		

Crossrefs

Extensions

Edited by M. F. Hasler, Dec 08 2016

A230811 Smallest starting number for n consecutive odd numbers that are primes or strong pseudoprime (base 2).

Original entry on oeis.org

3, 3, 3, 1640293473202755797
Offset: 1

Views

Author

Shyam Sunder Gupta, Oct 30 2013

Keywords

Comments

It is conjectured that there can be at most one more term, a(5).

Examples

			First and smallest occurrence of n, n >= 1, consecutive odd numbers that are primes or strong pseudoprime (base 2):
a(1) = 3: (3) ;
a(2) = 3: (3, 5) ;
a(3) = 3: (3, 5, 7);
a(4) = 1640293473202755797: (1640293473202755797, 1640293473202755799, 1640293473202755801, 1640293473202755803); (1640293473202755801 is strong pseudoprime base 2 and others are prime);
		

Crossrefs

Showing 1-2 of 2 results.