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.

A381901 Partition the natural numbers by letting a(1)=1 (denoting the set {1}) and for n>1 define a(n) to be the least integer such that the product of the set of integers {a(n-1)+1,...,a(n)} is an integer multiple of the previous partition's product.

Table of values

n a(n)
1 1
2 2
3 4
4 8
5 14
6 26
7 46
8 86
9 166
10 326
11 634
12 1262
13 2518
14 5006
15 10006
16 19946
17 39874
18 79738
19 159398
20 318778
21 637502
22 1274998
23 2549978
24 5099902
25 10199786
26 20399534
27 40799062
28 81598082
29 163196134
30 326392258
31 652784498
32 1305568942
33 2611137838
34 5222275634
35 10444551254

List of values

[1, 2, 4, 8, 14, 26, 46, 86, 166, 326, 634, 1262, 2518, 5006, 10006, 19946, 39874, 79738, 159398, 318778, 637502, 1274998, 2549978, 5099902, 10199786, 20399534, 40799062, 81598082, 163196134, 326392258, 652784498, 1305568942, 2611137838, 5222275634, 10444551254]