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.

A370857 Let L_1 = (1) and L_2 = (1, 2); for any n > 2, L_n is obtained by inserting one n between each pair of consecutive terms of L_{n-1} coprime to n; a(n) gives the number of n's in L_n.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 3
6 1
7 7
8 9
9 19
10 13
11 55
12 21
13 131
14 157
15 303
16 317
17 1039
18 393
19 2471
20 2505
21 5643
22 6145
23 19235
24 7413
25 40235
26 51905
27 110435
28 110683
29 359141
30 45877
31 764159
32 1077437
33 2253143
34 2251065
35 6699111
36 2200709
37 16009783
38 20505321
39 43172899
40 29699143
41 125396929

List of values

[1, 1, 1, 1, 3, 1, 7, 9, 19, 13, 55, 21, 131, 157, 303, 317, 1039, 393, 2471, 2505, 5643, 6145, 19235, 7413, 40235, 51905, 110435, 110683, 359141, 45877, 764159, 1077437, 2253143, 2251065, 6699111, 2200709, 16009783, 20505321, 43172899, 29699143, 125396929]