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.

A155886 Least k such that 2^(2^k) = n (mod k).

Original entry on oeis.org

1, 3, 14, 11, 6, 1941491, 10, 83, 31, 13, 123, 35, 71, 27, 34913, 241, 18, 8059, 34, 349, 44, 25, 39, 100867561, 76, 231, 253, 66203, 57, 227, 139, 45, 184, 37, 111, 97, 55, 41, 103, 1099, 81, 66791, 53
Offset: 0

Views

Author

T. D. Noe, Jan 29 2009

Keywords

Comments

First occurrence of n in sequence A155836.
a(43) > 12500000. - Tyler Busby, Mar 15 2024

Crossrefs

Cf. A015910 (2^n mod n), A036236, A155836.