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.

Previous Showing 41-50 of 110 results. Next

A062579 Numbers k such that 13^k - 12^k is prime.

Original entry on oeis.org

17, 31, 41, 47, 109, 163, 643, 2459, 9743, 30271, 87557
Offset: 1

Views

Author

Mike Oakes, May 18 2001, May 19 2001

Keywords

Comments

Terms greater than 1000 may correspond to (unproven) strong pseudoprimes. [Clarified by M. F. Hasler, Sep 16 2013]

Crossrefs

Programs

Extensions

Two more terms 30271 and 87557 (found in 2007 and 2008) from Jean-Louis Charton, Sep 02 2009

A062581 Numbers k such that 15^k - 14^k is prime.

Original entry on oeis.org

2, 3, 43, 173, 193, 7559, 165559
Offset: 1

Views

Author

Mike Oakes, May 18 2001, May 19 2001

Keywords

Comments

Terms greater than 1000 may correspond to (unproven) strong pseudoprimes. [Clarified by M. F. Hasler, Sep 16 2013]

Crossrefs

Programs

Extensions

a(7) from Jean-Louis Charton, Mar 28 2011

A062582 Numbers k such that 16^k - 15^k is prime.

Original entry on oeis.org

2, 43, 211, 1523, 1579, 1693, 12281, 24889
Offset: 1

Views

Author

Mike Oakes, May 18 2001, May 19 2001

Keywords

Comments

Terms greater than 1000 may correspond to (unproven) strong pseudoprimes.
No other terms less than 100000. - Robert Price, Apr 15 2012

Crossrefs

Programs

Extensions

a(7) (found by Mike Oakes in August 2003) and a(8) (found by Jean-Louis Charton in December 2010) from Jean-Louis Charton, Mar 19 2011
Edited by M. F. Hasler, Sep 16 2013

A062586 Numbers k such that 20^k - 19^k is prime.

Original entry on oeis.org

5, 17, 109, 1979, 6899, 7331, 18661, 79621, 81649
Offset: 1

Views

Author

Mike Oakes, May 18 2001, May 19 2001

Keywords

Comments

Terms k > 1000 may correspond to (unproven) strong pseudoprimes.

Crossrefs

Programs

Extensions

a(7)-a(9) found by Jean-Louis Charton in February and March 2011
Edited by M. F. Hasler, Sep 16 2013

A062588 Numbers k such that 22^k - 21^k is prime.

Original entry on oeis.org

2, 127, 877
Offset: 1

Views

Author

Mike Oakes, May 18 2001, May 19 2001

Keywords

Comments

All terms are prime.
No other terms less than 10^5. - Robert Price, May 28 2012

Crossrefs

Programs

A062593 Numbers k such that 27^k - 26^k is prime.

Original entry on oeis.org

2, 13, 157, 43117
Offset: 1

Views

Author

Mike Oakes, May 18 2001, May 19 2001

Keywords

Comments

Terms > 1000 are often only strong pseudoprimes.
a(5) > 10^5. - Robert Price, Aug 12 2012.

Crossrefs

Programs

Extensions

a(4) from Robert Price, Aug 12 2012

A062604 Numbers k such that 38^k - 37^k is prime.

Original entry on oeis.org

3, 379, 383, 1373, 1609, 24611, 38281
Offset: 1

Views

Author

Mike Oakes, May 18 2001, May 19 2001

Keywords

Comments

Terms greater than 1000 are often only strong pseudoprimes.
a(8) > 10^5. - Robert Price, Sep 03 2012

Crossrefs

Programs

Extensions

a(6) and a(7) from Robert Price, Sep 03 2012

A062608 Numbers k such that 42^k - 41^k is prime.

Original entry on oeis.org

2, 3, 5, 47, 67, 103
Offset: 1

Views

Author

Mike Oakes, May 18 2001, May 19 2001

Keywords

Comments

Terms greater than 1000 are often only strong pseudoprimes.
No further terms up to 5000. - Harvey P. Dale, Mar 13 2011
a(7) > 10^5. - Robert Price, Sep 21 2012

Crossrefs

Programs

A062612 Numbers k such that 46^k - 45^k is prime.

Original entry on oeis.org

3, 1087, 1879, 4349, 16829, 59791
Offset: 1

Views

Author

Mike Oakes, May 18 2001, May 19 2001

Keywords

Comments

Terms greater than 1000 are often only strong pseudoprimes.
a(7)>10^5. - Robert Price, Feb 18 2013

Crossrefs

Programs

Extensions

a(5) from Jean-Louis Charton, Jan 11 2013
a(6) from Jean-Louis Charton, Jan 16 2013

A062647 Numbers k such that 81^k - 80^k is prime.

Original entry on oeis.org

3, 43, 113, 157, 269, 709, 1109, 2027, 8297, 86837, 310721
Offset: 1

Views

Author

Mike Oakes, May 18 2001, May 19 2001

Keywords

Comments

Terms greater than 1000 are often only strong pseudoprimes.
a(11) > 10^5. - Robert Price, Jan 13 2015
Factors of these numbers are of the form p = 2*n*k + 1, just like the repunit numbers, but the PRP tests are significantly slower since there is not a fast mod() property like the repunits, where (number mod Rn) can be calculated with a folding of the digits at length n in base b. However, numbers of this form b^p - (b-1)^p seem to be prime with greater relative frequency than the repunits. While the repunits have a linear fit coefficient that approaches 0.56145948 (see link below for a Generalized Repunit Conjecture), this sequence currently has a linear fit coefficient of 0.22559. - Paul Bourdelais, Jul 06 2023

Crossrefs

Programs

Extensions

a(10) from Robert Price, Jan 13 2015 (Computer run by Adam Marciniec)
a(11) from Paul Bourdelais, Jul 06 2023
Previous Showing 41-50 of 110 results. Next