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.

A368940 Number of iterations before a repeated value, or -1 if this never occurs, when starting at k = 1 and repeating k = k*n if k does not contain any adjacent equal digits, else k = k with all adjacent equal digits replaced by a single copy of the same digit.

Table of values

n a(n)
1 1
2 86
3 338
4 816
5 2031
6 1570
7 2637
8 2392
9 4790
10 3
11 2
12 15199
13 21136
14 8124
15 12360
16 18210
17 101998
18 41798
19 15250
20 135
21 40063
22 27298
23 176470
24 6553
25 15757
26 5031
27 187645
28 24050
29 567055
30 487
31 141008
32 71243
33 341907
34 154758
35 38175
36 150429
37 84011
38 106833
39 351884
40 1117
41 391266
42 324631
43 1287699
44 374743

List of values

[1, 86, 338, 816, 2031, 1570, 2637, 2392, 4790, 3, 2, 15199, 21136, 8124, 12360, 18210, 101998, 41798, 15250, 135, 40063, 27298, 176470, 6553, 15757, 5031, 187645, 24050, 567055, 487, 141008, 71243, 341907, 154758, 38175, 150429, 84011, 106833, 351884, 1117, 391266, 324631, 1287699, 374743]