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.

A166512 2-comma numbers: n occurs in the sequence S[k+1] = S[k] + 10*last_digit(S[k-1]) + first_digit(S[k]) for two different splittings n=concat(S[0],S[1]).

Table of values

n a(n)
1 1023
2 1044
3 1521
4 1657
5 1789
6 1984
7 2191
8 2263
9 2451
10 2466
11 2523
12 2676
13 2783
14 2824
15 3066
16 3268
17 3589
18 3602
19 3631
20 4051
21 4113
22 4149
23 4159
24 4213
25 4315
26 4611
27 4685
28 4781
29 4969
30 5133
31 5526
32 6053
33 6165
34 6246
35 6445
36 6650
37 6712
38 6893
39 7350
40 7668
41 8011
42 8144

List of values

[1023, 1044, 1521, 1657, 1789, 1984, 2191, 2263, 2451, 2466, 2523, 2676, 2783, 2824, 3066, 3268, 3589, 3602, 3631, 4051, 4113, 4149, 4159, 4213, 4315, 4611, 4685, 4781, 4969, 5133, 5526, 6053, 6165, 6246, 6445, 6650, 6712, 6893, 7350, 7668, 8011, 8144]