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.

A361593 a(1) = 1, a(2) = 2, a(3) = 3; for n > 3, a(n) is the smallest positive number which has not appeared such that all the distinct prime factors of a(n-3) + a(n-2) + a(n-1) are factors of a(n).

Table of values

n a(n)
1 1
2 2
3 3
4 6
5 11
6 10
7 9
8 30
9 7
10 46
11 83
12 34
13 163
14 70
15 267
16 20
17 357
18 322
19 699
20 1378
21 2399
22 2238
23 6015
24 5326
25 13579
26 6230
27 25135
28 106
29 31471
30 14178
31 45755
32 15234
33 75167
34 68078
35 8341
36 151586
37 228005
38 193966
39 573557
40 248882
41 1016405
42 306474
43 1571761
44 361830
45 2240065
46 1043414
47 3645309
48 3464394

List of values

[1, 2, 3, 6, 11, 10, 9, 30, 7, 46, 83, 34, 163, 70, 267, 20, 357, 322, 699, 1378, 2399, 2238, 6015, 5326, 13579, 6230, 25135, 106, 31471, 14178, 45755, 15234, 75167, 68078, 8341, 151586, 228005, 193966, 573557, 248882, 1016405, 306474, 1571761, 361830, 2240065, 1043414, 3645309, 3464394]