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

A348170 Numbers k such that (35^k - 1)/34 is prime.

Original entry on oeis.org

313, 1297, 568453
Offset: 1

Views

Author

Paul Bourdelais, Oct 04 2021

Keywords

Comments

These are the repunit primes in base 35.

Examples

			313 is a term since (35^313 - 1)/34 is a prime. It has 482 digits in base 10.
		

Crossrefs

Programs

  • Mathematica
    Do[ If[ PrimeQ[ (35^n-1)/34], Print[n]], {n, 0, 600000}]
  • PARI
    is(n)=isprime((35^n-1)/34)

A350036 Numbers k such that (81^k + 1)/82 is prime.

Original entry on oeis.org

3, 5, 701, 829, 1031, 1033, 7229, 19463, 370421
Offset: 1

Views

Author

Paul Bourdelais, Dec 09 2021

Keywords

Comments

These are the Repunits in base -81. Since 81=3^4, factors will be of the form p=8nk+1. (Negative) bases that are powers of small numbers appear to have a higher frequency of primes than Repunits in other bases. The best linear fit for this base is currently 0.29918 which is much lower (better) than the conjectured 0.56145948 (see link to conjecture).

Examples

			3 is a term since (81^3 + 1)/82 = 6481 is a prime.
		

Crossrefs

Programs

  • Mathematica
    Do[ If[ PrimeQ[ (81^n+1)/82], Print[n]], {n, 0, 1000000}]
  • PARI
    is(n)=isprime((81^n+1)/82)
Previous Showing 11-12 of 12 results.