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.

A364890 Least number k such that A060778(k) = n.

Original entry on oeis.org

1, 2, 49, 14, 80, 44, 529983, 104, 16640, 2511, 8212890624, 735, 1019423412224, 29888, 600624, 2295, 54020648488730624, 6075, 3018417549254328320, 5264, 123200, 24151040, 3264402128528250685620224, 5984, 1753599375, 689278976, 2310399, 156735, 27965083137654166225393025024, 180224, 11404289746101879774056466612224, 21735, 170853262335, 2035980763136, 207593229375, 223244
Offset: 1

Views

Author

Seiichi Manyama, Aug 12 2023

Keywords

Crossrefs

Programs

  • PARI
    a(n) = my(x=1, nx=1, ny=2); while(gcd(nx, ny) != n, x++; nx=ny; ny=numdiv(x+1)); x;

Extensions

a(11),a(13),a(17),a(19),a(23)-a(36) from Max Alekseyev, Feb 18 2024