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.

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

Table of values

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

List of values

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