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.

A077224 a(0) = 1; for n > 1, a(n) = smallest number > a(n-1) such that a(n) + a(k) is squarefree for k = 1 to n-1.

Table of values

n a(n)
0 1
1 2
2 4
3 9
4 13
5 29
6 33
7 101
8 105
9 109
10 157
11 177
12 253
13 289
14 301
15 353
16 409
17 429
18 465
19 501
20 533
21 553
22 589
23 609
24 681
25 753
26 877
27 933
28 965
29 1153
30 1477
31 1905
32 1977
33 2101
34 2125
35 2229
36 2305
37 2405
38 2605
39 2657
40 2801
41 2913
42 3305
43 3381
44 3489
45 3565
46 3777
47 3781
48 3881
49 4029

List of values

[1, 2, 4, 9, 13, 29, 33, 101, 105, 109, 157, 177, 253, 289, 301, 353, 409, 429, 465, 501, 533, 553, 589, 609, 681, 753, 877, 933, 965, 1153, 1477, 1905, 1977, 2101, 2125, 2229, 2305, 2405, 2605, 2657, 2801, 2913, 3305, 3381, 3489, 3565, 3777, 3781, 3881, 4029]