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.

A376511 a(1) = 2. For n > 1, if a(n-1) is a novel term, a(n)=A001414(a(n-1)), else if there are k (>1) occurrences of a(j) = a(n-1) (1<=j<=n-1), a(n) is the smallest novel m such that A001414(m) = k*a(n-1).

Table of values

n a(n)
1 2
2 2
3 4
4 4
5 15
6 8
7 6
8 5
9 5
10 21
11 10
12 7
13 7
14 33
15 14
16 9
17 6
18 35
19 12
20 7
21 38
22 21
23 185
24 42
25 12
26 95
27 24
28 9
29 65
30 18
31 8
32 39
33 16
34 8
35 114
36 24
37 215
38 48
39 11
40 11
41 57
42 22
43 13
44 13
45 69
46 26
47 15
48 161
49 30
50 10
51 51
52 20
53 9
54 92
55 27
56 9
57 155
58 36
59 10
60 209
61 30
62 371
63 60
64 12
65 186
66 36
67 335
68 72

List of values

[2, 2, 4, 4, 15, 8, 6, 5, 5, 21, 10, 7, 7, 33, 14, 9, 6, 35, 12, 7, 38, 21, 185, 42, 12, 95, 24, 9, 65, 18, 8, 39, 16, 8, 114, 24, 215, 48, 11, 11, 57, 22, 13, 13, 69, 26, 15, 161, 30, 10, 51, 20, 9, 92, 27, 9, 155, 36, 10, 209, 30, 371, 60, 12, 186, 36, 335, 72]