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.

A230311 Numbers n such that 1^(k*n) + 2^(k*n) + ... + (k*n)^(k*n) == k (mod k*n) for some k; that is, numbers n such that A031971(k*n) == k (mod k*n) for some k.

Table of values

n a(n)
1 1
2 2
3 6
4 42
5 1806
6 47058
7 2214502422
8 8490421583559688410706771261086

List of values

[1, 2, 6, 42, 1806, 47058, 2214502422, 8490421583559688410706771261086]

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

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