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.

A344486 a(n) is the least k such that the sum of digits of k is a substring of n and the sum of digits of n is a substring of k.

Table of values

n a(n)
0 0
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
9 9
10 1
11 29
12 39
13 49
14 59
15 69
16 79
17 89
18 99
19 10
20 2
21 399
22 499
23 599
24 699
25 799
26 899
27 999
28 101
29 11
30 3
31 4999
32 5999
33 6999
34 7999
35 8999
36 9999
37 102
38 111
39 12
40 4
41 59999
42 69999
43 79999
44 89999
45 99999
46 103
47 112
48 112
49 13
50 5
51 699999
52 799999
53 899999
54 999999

List of values

[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 29, 39, 49, 59, 69, 79, 89, 99, 10, 2, 399, 499, 599, 699, 799, 899, 999, 101, 11, 3, 4999, 5999, 6999, 7999, 8999, 9999, 102, 111, 12, 4, 59999, 69999, 79999, 89999, 99999, 103, 112, 112, 13, 5, 699999, 799999, 899999, 999999]