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.

A354184 a(1) = a(2) = 1, a(n) = (A007947(31*a(n-1)) + A007947(31*a(n-2)))/31 for n >= 3, i.e., 31*a(n) is the largest squarefree divisor of 31*a(n-1) plus the largest squarefree divisor of 31*a(n-2).

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 5
6 8
7 7
8 9
9 10
10 13
11 23
12 36
13 29
14 35
15 64
16 37
17 39
18 76
19 77
20 115
21 192
22 121
23 17
24 28
25 31
26 15
27 16
28 17
29 19
30 36
31 25
32 11
33 16
34 13
35 15
36 28
37 29
38 43
39 72
40 49
41 13
42 20
43 23
44 33
45 56
46 47
47 61
48 108
49 67
50 73
51 140
52 143
53 213
54 356
55 391
56 569
57 960
58 599
59 629
60 1228
61 1243
62 1857
63 3100
64 1867

List of values

[1, 1, 2, 3, 5, 8, 7, 9, 10, 13, 23, 36, 29, 35, 64, 37, 39, 76, 77, 115, 192, 121, 17, 28, 31, 15, 16, 17, 19, 36, 25, 11, 16, 13, 15, 28, 29, 43, 72, 49, 13, 20, 23, 33, 56, 47, 61, 108, 67, 73, 140, 143, 213, 356, 391, 569, 960, 599, 629, 1228, 1243, 1857, 3100, 1867]