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.

A277962 Least k such that A006577(k) = A006577(n) + A006577(n+1).

Table of values

n a(n)
1 2
2 6
3 12
4 3
5 34
6 49
7 9
8 72
9 98
10 18
11 25
12 28
13 33
14 39
15 36
16 7
17 57
18 406
19 65
20 11
21 72
22 86
23 98
24 114
25 114
26 129
27 913
28 153
29 153
30 171
31 27
32 172
33 203
34 33
35 39
36 270
37 270
38 295
39 270
40 290
41 290
42 305
43 361
44 57
45 57
46 386
47 73
48 78
49 481
50 481
51 78
52 72
53 514
54 20174
55 609
56 641
57 641
58 641
59 641

List of values

[2, 6, 12, 3, 34, 49, 9, 72, 98, 18, 25, 28, 33, 39, 36, 7, 57, 406, 65, 11, 72, 86, 98, 114, 114, 129, 913, 153, 153, 171, 27, 172, 203, 33, 39, 270, 270, 295, 270, 290, 290, 305, 361, 57, 57, 386, 73, 78, 481, 481, 78, 72, 514, 20174, 609, 641, 641, 641, 641]