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.

A247069 a(n) = number of distinct primes obtained when inserting 1 anywhere in A069246(n).

Table of values

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

List of values

[2, 2, 2, 2, 3, 3, 2, 2, 3, 4, 3, 3, 3, 2, 2, 3, 4, 4, 2, 3, 4, 3, 3, 4, 3, 5, 5, 5, 5, 4, 4, 4, 6, 4, 5, 5, 5, 6, 5, 4, 6, 6, 5, 4, 5, 6, 7, 6, 5, 5, 4, 5, 5, 6, 3, 5, 6, 5, 6, 5, 6, 3, 6, 7, 5, 5, 4, 5, 5, 5, 6, 4, 7, 4, 4, 6, 6, 4, 5, 7, 3, 3, 3, 4, 3, 5, 2, 3, 5, 5, 6, 7, 6, 4, 7, 5, 6, 5, 7, 3, 8]