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.

A386872 Smallest k for which A385662(k) = n, or -1 if no such k exists.

Original entry on oeis.org

1, 2, 6, 12, 18, 24, 54, 48, 72, 96, 270, 120, 450, 384, 288, 240, 2310, 360, 1890, 480, 1152, 3150, 4050, 720, 2592, 6930, 1800, 1920, 17010, 1440
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Aug 06 2025

Keywords

Crossrefs

Programs

  • PARI
    f(n) = sumdiv(n, d, Mod(d, n)^d == Mod(-d, n)^d); \\ A385662
    a(n) = my(k=1); while (f(k) != n, k++); k; \\ Michel Marcus, Aug 06 2025