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.

A323359 a(n) = b(n+1)/b(n) - 1 where b(1)=2 and b(k) = b(k-1) + lcm(floor(sqrt(k^3)), b(k-1)).

Table of values

n a(n)
1 1
2 5
3 1
4 11
5 7
6 1
7 11
8 1
9 31
10 1
11 41
12 23
13 13
14 29
15 1
16 1
17 19
18 41
19 89
20 1
21 103
22 11
23 1
24 1
25 11
26 1
27 37
28 1
29 41
30 43
31 181
32 1
33 1
34 23
35 1
36 1
37 1
38 1
39 1
40 131
41 17
42 281
43 97
44 43
45 311
46 23
47 83
48 1
49 353
50 1
51 17
52 1
53 1
54 37
55 419
56 43
57 1
58 151
59 29
60 17
61 61
62 1
63 1
64 131
65 67
66 137
67 1
68 191
69 1
70 1
71 61
72 89

List of values

[1, 5, 1, 11, 7, 1, 11, 1, 31, 1, 41, 23, 13, 29, 1, 1, 19, 41, 89, 1, 103, 11, 1, 1, 11, 1, 37, 1, 41, 43, 181, 1, 1, 23, 1, 1, 1, 1, 1, 131, 17, 281, 97, 43, 311, 23, 83, 1, 353, 1, 17, 1, 1, 37, 419, 43, 1, 151, 29, 17, 61, 1, 1, 131, 67, 137, 1, 191, 1, 1, 61, 89]