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.

A000236 Maximum m such that there are no two adjacent elements belonging to the same n-th power residue class modulo some prime p in the sequence 1,2,...,m (equivalently, there is no n-th power residue modulo p in the sequence 1/2,2/3,...,(m-1)/m).

Table of values

n a(n)
2 3
3 8
4 20
5 44
6 80
7 343
8 288
9 608
10 1023
11 2848
12 4095
13 40959
14 16383
15 32768
16 11375
17 655360
18 262143
19 3670016
20 1048575
21 2097151

List of values

[3, 8, 20, 44, 80, 343, 288, 608, 1023, 2848, 4095, 40959, 16383, 32768, 11375, 655360, 262143, 3670016, 1048575, 2097151]

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

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