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.

A358344 a(1) = 0; a(n) = the smallest number such that the concatenation a(1)a(2)...a(n) is prime in the smallest allowed base; sequence terminates at index m if a(1)a(2)...a(m)k is composite in the smallest allowed base for all k.

Table of values

n a(n)
1 0
2 2
3 1
4 2
5 2
6 3
7 1
8 5
9 9
10 7
11 21
12 5
13 31
14 49
15 39
16 104
17 2
18 34
19 44
20 74
21 22
22 64
23 16
24 107
25 549
26 81
27 207
28 273
29 87
30 497
31 27
32 556
33 42
34 150
35 32
36 44
37 144
38 340
39 28
40 198
41 677
42 13
43 61
44 209
45 377
46 893
47 329
48 391
49 49
50 83
51 425
52 197
53 1017
54 205
55 191
56 163
57 1131
58 291
59 281
60 295
61 389

List of values

[0, 2, 1, 2, 2, 3, 1, 5, 9, 7, 21, 5, 31, 49, 39, 104, 2, 34, 44, 74, 22, 64, 16, 107, 549, 81, 207, 273, 87, 497, 27, 556, 42, 150, 32, 44, 144, 340, 28, 198, 677, 13, 61, 209, 377, 893, 329, 391, 49, 83, 425, 197, 1017, 205, 191, 163, 1131, 291, 281, 295, 389]