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.

A339566 Primes p such that A007088(p) == 1 (mod p).

Original entry on oeis.org

5, 137, 3967, 25087, 242899421
Offset: 1

Views

Author

Robert Israel, Dec 09 2020

Keywords

Examples

			a(3) = 3967 is in the sequence because 3967 = 111101111111_2 and 111101111111 == 1 (mod 3967).
		

Crossrefs

Primes in A339567.

Programs

  • Maple
    p:= 1: R:= NULL:
    while p < 3*10^8 do
    p:= nextprime(p);
    if convert(p,binary) mod p = 1 then R:= R, p fi
    od:
    R;
  • Python
    from sympy import nextprime
    A339566_list, p = [], 2
    while p < 10**10:
        if int(bin(p)[2:]) % p == 1:
            A339566_list.append(p)
        p = nextprime(p) # Chai Wah Wu, Dec 14 2020