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.

A154998 Primes p such that p^2 divides A048861((p-1)/2).

Original entry on oeis.org

3, 2001907169
Offset: 1

Views

Author

Max Alekseyev, Jan 18 2009

Keywords

Comments

No other terms below 10^11.

Crossrefs

Programs

  • PARI
    { forprime(p=3,10^11, if(Mod((p-1)/2,p^2)^((p-1)/2)==1, print(p);)) }

Formula

Elements of A125854 congruent to 1 or 3 modulo 8, i.e., primes p such that p == 1 or 3 (mod 8) and 2^(p-1) == 1+p (mod p^2).

Extensions

Edited by Max Alekseyev, Oct 13 2009