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.

A102664 Lexically least sequence of distinct positive integers such that for all j and k, 1+a(j)-a(k) is 0, 1 or not a square.

Table of values

n a(n)
1 1
2 2
3 3
4 7
5 8
6 12
7 13
8 14
9 19
10 24
11 30
12 35
13 40
14 41
15 46
16 52
17 53
18 57
19 58
20 63
21 69
22 74
23 79
24 80
25 85
26 86
27 90
28 91
29 96
30 97
31 108
32 119
33 124
34 130
35 135
36 136
37 141
38 147
39 158
40 163
41 164
42 174
43 186
44 191
45 213
46 224
47 245
48 288
49 297
50 299
51 316
52 322
53 327
54 338
55 339
56 349
57 350
58 355
59 366
60 383
61 389

List of values

[1, 2, 3, 7, 8, 12, 13, 14, 19, 24, 30, 35, 40, 41, 46, 52, 53, 57, 58, 63, 69, 74, 79, 80, 85, 86, 90, 91, 96, 97, 108, 119, 124, 130, 135, 136, 141, 147, 158, 163, 164, 174, 186, 191, 213, 224, 245, 288, 297, 299, 316, 322, 327, 338, 339, 349, 350, 355, 366, 383, 389]