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.

A166508 Hypercomma numbers: n occurs in the sequence S[k+1]=S[k]+10*last_digit(S[k-1])+first_digit(S[k]) for each "legal" splitting n=concat(S[0],S[1]).

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
9 9
10 10
11 20
12 30
13 40
14 50
15 60
16 70
17 80
18 90
19 109
20 806
21 1023
22 1044
23 2005
24 2676
25 3066
26 3602
27 4051
28 6053
29 6246
30 8011
31 8349
32 9427
33 10022
34 10074
35 10587
36 13090
37 15031
38 16867
39 20088
40 20699
41 21698
42 23108
43 29986
44 30091
45 30306
46 32226
47 40022

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 20, 30, 40, 50, 60, 70, 80, 90, 109, 806, 1023, 1044, 2005, 2676, 3066, 3602, 4051, 6053, 6246, 8011, 8349, 9427, 10022, 10074, 10587, 13090, 15031, 16867, 20088, 20699, 21698, 23108, 29986, 30091, 30306, 32226, 40022]