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-10 of 12 results. Next

A229524 Numbers k such that (38^k + 1)/39 is prime.

Original entry on oeis.org

5, 167, 1063, 1597, 2749, 3373, 13691, 83891, 131591
Offset: 1

Views

Author

Robert Price, Sep 25 2013

Keywords

Comments

All terms are primes. a(9) > 10^5.

Crossrefs

Programs

  • Mathematica
    Do[ p=Prime[n]; If[ PrimeQ[ (38^p + 1)/39 ], Print[p] ], {n, 1, 9592} ]
  • PARI
    is(n)=ispseudoprime((38^n+1)/39) \\ Charles R Greathouse IV, Feb 17 2017

Extensions

a(9)=131591 corresponds to a probable prime discovered by Paul Bourdelais, Jul 03 2018

A229663 Numbers n such that (40^n + 1)/41 is prime.

Original entry on oeis.org

53, 67, 1217, 5867, 6143, 11681, 29959
Offset: 1

Views

Author

Robert Price, Sep 27 2013

Keywords

Comments

All terms are primes.
a(8) > 10^5.

Crossrefs

Programs

  • Mathematica
    Do[ p=Prime[n]; If[ PrimeQ[ (40^p + 1)/41 ], Print[p] ], {n, 1, 9592} ]
  • PARI
    is(n)=ispseudoprime((40^n+1)/41) \\ Charles R Greathouse IV, Feb 17 2017

A230036 Numbers n such that (39^n + 1)/40 is prime.

Original entry on oeis.org

3, 13, 149, 15377
Offset: 1

Views

Author

Robert Price, Oct 05 2013

Keywords

Comments

All terms are primes.
a(5) > 10^5.

Crossrefs

Programs

  • Mathematica
    Do[ p=Prime[n]; If[ PrimeQ[ (39^p + 1)/40 ], Print[p] ], {n, 1, 9592} ]
  • PARI
    is(n)=ispseudoprime((39^n+1)/40) \\ Charles R Greathouse IV, Feb 17 2017

A231604 Numbers n such that (42^n + 1)/43 is prime.

Original entry on oeis.org

3, 709, 1637, 17911, 127609, 172663
Offset: 1

Views

Author

Robert Price, Nov 11 2013

Keywords

Comments

The first 5 terms are primes.

Crossrefs

Programs

  • Mathematica
    Do[ p=Prime[n]; If[ PrimeQ[ (42^p + 1)/43 ], Print[p] ], {n, 1, 9592} ]
  • PARI
    is(n)=ispseudoprime((42^n+1)/43) \\ Charles R Greathouse IV, Feb 20 2017

Extensions

a(5)=127609 corresponds to a probable prime discovered by Paul Bourdelais, Jul 02 2018
a(6)=172663 corresponds to a probable prime discovered by Paul Bourdelais, Jul 29 2019

A231865 Numbers n such that (43^n + 1)/44 is prime.

Original entry on oeis.org

5, 7, 19, 251, 277, 383, 503, 3019, 4517, 9967, 29573
Offset: 1

Views

Author

Robert Price, Nov 14 2013

Keywords

Comments

All terms are primes.
a(11) > 10^5.

Crossrefs

Programs

  • Mathematica
    Do[ p=Prime[n]; If[ PrimeQ[ (43^p + 1)/44 ], Print[p] ], {n, 1, 9592} ]
  • PARI
    is(n)=ispseudoprime((43^n+1)/44) \\ Charles R Greathouse IV, Feb 20 2017

A235683 Numbers n such that (46^n + 1)/47 is prime.

Original entry on oeis.org

7, 23, 59, 71, 107, 223, 331, 2207, 6841, 94841
Offset: 1

Views

Author

Robert Price, Jan 13 2014

Keywords

Comments

All terms up to a(10) are primes.
a(11) > 10^5.

Crossrefs

Programs

  • Mathematica
    Do[ p=Prime[n]; If[ PrimeQ[ (46^p + 1)/47 ], Print[p] ], {n, 1, 9592} ]
  • PARI
    is(n)=ispseudoprime((46^n+1)/47) \\ Charles R Greathouse IV, May 22 2017

A237052 Numbers n such that (49^n + 1)/50 is prime.

Original entry on oeis.org

7, 19, 37, 83, 1481, 12527, 20149
Offset: 1

Views

Author

Robert Price, Feb 02 2014

Keywords

Comments

All terms are primes.
a(8) > 10^5.

Crossrefs

Programs

  • Mathematica
    Do[ p=Prime[n]; If[ PrimeQ[ (49^p + 1)/50 ], Print[p] ], {n, 1, 9592} ]
  • PARI
    is(n)=ispseudoprime((49^n+1)/50) \\ Charles R Greathouse IV, Jun 13 2017

Extensions

Typo in description corrected by Ray Chandler, Feb 20 2017

A236167 Numbers k such that (47^k + 1)/48 is prime.

Original entry on oeis.org

5, 19, 23, 79, 1783, 7681
Offset: 1

Views

Author

Robert Price, Jan 19 2014

Keywords

Comments

a(7) > 10^5.

Crossrefs

Programs

  • Mathematica
    Do[ p=Prime[n]; If[ PrimeQ[ (47^p + 1)/48 ], Print[p] ], {n, 1, 9592} ]
  • PARI
    is(n)=ispseudoprime((47^n+1)/48) \\ Charles R Greathouse IV, Jun 06 2017
    
  • Python
    from sympy import isprime
    def afind(startat=0, limit=10**9):
      pow47 = 47**startat
      for k in range(startat, limit+1):
        q, r = divmod(pow47+1, 48)
        if r == 0 and isprime(q): print(k, end=", ")
        pow47 *= 47
    afind(limit=300) # Michael S. Branicky, May 19 2021

A236530 Numbers n such that (48^n + 1)/49 is prime.

Original entry on oeis.org

5, 17, 131, 84589
Offset: 1

Views

Author

Robert Price, Jan 27 2014

Keywords

Comments

All terms are primes.
a(5) > 10^5.

Crossrefs

Programs

  • Mathematica
    Do[ p=Prime[n]; If[ PrimeQ[ (48^p + 1)/49 ], Print[p] ], {n, 1, 9592} ]
  • PARI
    is(n)=ispseudoprime((48^n+1)/49) \\ Charles R Greathouse IV, Jun 13 2017

Extensions

Incorrect first term deleted by Robert Price, Feb 21 2014

A347138 Numbers k such that (100^k + 1)/101 is prime.

Original entry on oeis.org

3, 293, 461, 11867, 90089
Offset: 1

Views

Author

Paul Bourdelais, Aug 19 2021

Keywords

Comments

These are the repunit primes in base -100. It is unusual to represent numbers in a negative base, but it follows the same formulation as any base: numbers are represented as a sum of powers in that base, i.e., a0*1 + a1*b^1 + a2*b^2 + a3*b^3 ... Since the base is negative, the terms will be alternating positive/negative. For repunits the coefficients are all ones so the sum reduces to 1 + b + b^2 + b^3 + ... + b^(k-1) = (b^k-1)/(b-1). Since b is negative and k is an odd prime, the sum equals (|b|^k+1)/(|b|+1). For k=3, the sum is 9901, which is prime. As with all repunits, we only need to PRP test the prime exponents. The factors of repunits base -100 will be of the form p=2*k*m+1 where m must be even, which is common for (negative) bases that are squares.

Examples

			3 is a term since (100^3 + 1)/101 = 9901 is a prime.
		

Crossrefs

Programs

  • Mathematica
    Do[ If[ PrimeQ[ (100^n + 1)/101], Print[n]], {n, 0, 18000}]
  • PARI
    is(n)=isprime((100^n+1)/101)
Showing 1-10 of 12 results. Next