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.

A025521 Least k>1 such that complement of first n terms of A022303 repeats beginning at k-th term.

Table of values

n a(n)
1 2
2 2
3 2
4 15
5 15
6 15
7 15
8 41
9 41
10 41
11 41
12 41
13 41
14 41
15 41
16 41
17 41
18 41
19 41
20 41
21 41
22 123
23 123
24 123
25 123
26 123
27 123
28 123
29 123
30 123
31 123
32 123
33 123
34 123
35 123
36 123
37 123
38 123
39 123
40 691
41 691
42 691
43 691
44 691
45 691
46 691
47 691
48 691
49 691
50 691
51 691
52 691
53 691
54 691
55 691
56 691
57 691
58 691
59 691
60 691

List of values

[2, 2, 2, 15, 15, 15, 15, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 691, 691, 691, 691, 691, 691, 691, 691, 691, 691, 691, 691, 691, 691, 691, 691, 691, 691, 691, 691, 691]

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

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