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.

A079031 Least k > n such that p(n) divides p(k), where p(k) denotes the k-th partition number (A000041).

Table of values

n a(n)
0 1
1 2
2 8
3 7
4 7
5 10
6 8
7 9
8 15
9 97
10 26
11 75
12 16
13 356
14 39
15 96
16 39
17 39
18 39
19 264
20 470
21 776
22 97
23 711
24 249
25 765
26 4458
27 334
28 699
29 1084
30 18911
31 7150
32 1447
33 4604
34 1399
35 446
36 36041
37 5836
38 3504
39 1449
40 4359
41 6034
42 688
43 60818
44 4514
45 90825
46 34641
47 36852
48 77173
49 11100
50 2564

List of values

[1, 2, 8, 7, 7, 10, 8, 9, 15, 97, 26, 75, 16, 356, 39, 96, 39, 39, 39, 264, 470, 776, 97, 711, 249, 765, 4458, 334, 699, 1084, 18911, 7150, 1447, 4604, 1399, 446, 36041, 5836, 3504, 1449, 4359, 6034, 688, 60818, 4514, 90825, 34641, 36852, 77173, 11100, 2564]