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.

A344214 Numbers k such that repeated iterations of f(m) = (digsum(f(m-1)))^2 + 1 starting from f(1) = k will eventually yield 5 before any other single-digit number.

Table of values

n a(n)
1 5
2 11
3 15
4 18
5 19
6 20
7 24
8 27
9 28
10 33
11 36
12 37
13 39
14 42
15 45
16 46
17 48
18 51
19 54
20 55
21 57
22 60
23 63
24 64
25 66
26 69
27 72
28 73
29 75
30 78
31 81
32 82
33 84
34 87
35 90
36 91
37 93
38 96
39 99
40 101
41 105
42 108
43 109
44 110
45 114
46 117
47 118
48 123
49 126
50 127
51 129
52 132
53 135
54 136
55 138
56 141
57 144
58 145
59 147
60 150
61 153
62 154

List of values

[5, 11, 15, 18, 19, 20, 24, 27, 28, 33, 36, 37, 39, 42, 45, 46, 48, 51, 54, 55, 57, 60, 63, 64, 66, 69, 72, 73, 75, 78, 81, 82, 84, 87, 90, 91, 93, 96, 99, 101, 105, 108, 109, 110, 114, 117, 118, 123, 126, 127, 129, 132, 135, 136, 138, 141, 144, 145, 147, 150, 153, 154]