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.

A333358 a(1) = 0. For n>1, a(n+1) = the minimum positive m such that the concatenation of the decimal values [a(n-m),a(n-m+1),...,a(n-m+k)] equals a(n) for some k>=0; a(n+1) = a(n) + 1 if no such m exists.

Table of values

n a(n)
1 0
2 1
3 2
4 3
5 4
6 5
7 6
8 7
9 8
10 9
11 10
12 11
13 12
14 11
15 2
16 12
17 3
18 13
19 14
20 15
21 16
22 17
23 18
24 19
25 20
26 21
27 22
28 23
29 25
30 26
31 27
32 28
33 29
34 30
35 31
36 32
37 33
38 34
39 34
40 1
41 38
42 39
43 40
44 41
45 42
46 43
47 44
48 45
49 43
50 3
51 33
52 14
53 33
54 2
55 39
56 13
57 38
58 16
59 37
60 38
61 3
62 11
63 48
64 49
65 50
66 51
67 52
68 53
69 54
70 55
71 56
72 65
73 66
74 67
75 67
76 1
77 36

List of values

[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 11, 2, 12, 3, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 34, 1, 38, 39, 40, 41, 42, 43, 44, 45, 43, 3, 33, 14, 33, 2, 39, 13, 38, 16, 37, 38, 3, 11, 48, 49, 50, 51, 52, 53, 54, 55, 56, 65, 66, 67, 67, 1, 36]