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.

A241181 Start with n; add to it any of its digits; repeat; a(n) = minimal number of steps needed to reach a prime.

Table of values

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

List of values

[1, 0, 0, 3, 0, 2, 0, 2, 2, 1, 0, 1, 0, 2, 2, 1, 0, 1, 0, 6, 1, 5, 0, 4, 2, 3, 1, 5, 0, 6, 0, 2, 5, 1, 2, 4, 0, 1, 3, 4, 0, 4, 0, 3, 2, 3, 0, 2, 1, 5, 2, 2, 0, 1, 4, 1, 4, 3, 0, 3, 0, 3, 3, 3, 1, 2, 0, 2, 4, 4, 0, 1, 0, 2, 4, 1, 3, 3, 0, 4, 1, 3, 0, 2, 3, 2, 2]