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.

A342999 a(n) is always followed by the concatenation of a(n)'s distinct prime factors in increasing order. If this concatenation is already in the sequence, a(n+1) is the smallest term not yet present.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 23
8 7
9 8
10 9
11 10
12 25
13 11
14 12
15 13
16 14
17 27
18 15
19 35
20 57
21 319
22 1129
23 16
24 17
25 18
26 19
27 20
28 21
29 37
30 22
31 211
32 24
33 26
34 213
35 371
36 753
37 3251
38 28
39 29
40 30
41 235
42 547
43 31
44 32
45 33
46 311
47 34
48 217
49 731
50 1743
51 3783
52 31397
53 36
54 38
55 219
56 373
57 39
58 313
59 40
60 41
61 42
62 237
63 379
64 43
65 44
66 45
67 46
68 223
69 47

List of values

[1, 2, 3, 4, 5, 6, 23, 7, 8, 9, 10, 25, 11, 12, 13, 14, 27, 15, 35, 57, 319, 1129, 16, 17, 18, 19, 20, 21, 37, 22, 211, 24, 26, 213, 371, 753, 3251, 28, 29, 30, 235, 547, 31, 32, 33, 311, 34, 217, 731, 1743, 3783, 31397, 36, 38, 219, 373, 39, 313, 40, 41, 42, 237, 379, 43, 44, 45, 46, 223, 47]