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.

A069042 Numbers k such that A000364(k) == 1 (mod k^2).

Original entry on oeis.org

1, 2, 17, 37, 1153, 1303
Offset: 1

Views

Author

Benoit Cloitre, Apr 06 2003

Keywords

Crossrefs

Programs

  • Mathematica
    Select[Range[1, 10000], Divisible[Abs[EulerE[2*#]] - 1, #^2] &] (* Amiram Eldar, Jun 03 2017 *)
  • PARI
    is(k) = Mod(abs(eulerfrac(2*k)), k^2) == 1; \\ Jinyuan Wang, Mar 13 2025

Extensions

More terms from Hans Havermann, Apr 07 2003
a(1) prepended by Jinyuan Wang, Mar 13 2025