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.

A287959 Odd primes p such that p^2 divides A001205(p)-(p-1)/2.

Original entry on oeis.org

3, 43, 8237, 14533, 26153, 11314271
Offset: 1

Views

Author

Amiram Eldar, Jun 03 2017

Keywords

Comments

Carlitz proved that A001205(p) == (p-1)/2 (mod p) for all odd primes p. This sequence consists of odd primes for which A001205(p) == (p-1)/2 (mod p^2) holds.
a(7) > 2.3*10^7. - Giovanni Resta, Jun 04 2017

Crossrefs

Cf. A001205.

Programs

  • Mathematica
    a[1] = 0; a[2] = 0; a[3] = 1; a[n_] := a[n] = (n - 1)*(a[n - 1] + (n - 2)*a[n - 3]/2); lst = {}; k = 3; While[Length[lst] < 5, If[PrimeQ[k] && Divisible[a[k] - (k - 1)/2, k^2], lst = AppendTo[lst, k]]; k++]; lst

Extensions

a(6) from Giovanni Resta, Jun 04 2017