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.

A231409 Least k with 1^(k*m) + 2^(k*m) + ... + (k*m)^(k*m) == k (mod k*m) for m in A230311.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 5
7 5
8 39607528021345872635

List of values

[1, 1, 1, 1, 1, 5, 5, 39607528021345872635]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.