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.

A230299 Define a sequence b_s by b_s(1)=s, b_s(k+1)=b_s(k)+(sum of digits of b_s(k)); a(n) is the number of steps needed for b_n to reach a term in one of b_0, b_1, b_3 or b_9, or a(n) = -1 if b_n never joins one of these four sequences.

Table of values

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

List of values

[0, 0, 0, 0, 0, 52, 0, 11, 0, 0, 51, 50, 0, 49, 10, 0, 0, 48, 0, 9, 50, 0, 49, 0, 0, 47, 48, 0, 0, 8, 0, 49, 46, 0, 47, 48, 0, 45, 0, 0, 7, 46, 7, 47, 6, 0, 45, 44, 6, 0, 46, 0, 5, 5, 0, 45, 44, 0, 43, 4, 5, 4, 0, 0, 4, 44, 4, 43, 3, 0, 0, 42, 0, 3, 3, 4, 43, 0]