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.

A066496 a(n) = least solution k of f(k) = f(k-1) + ... + f(k-n), where f(m) = prime(m+1)-prime(m) and prime(m) denotes the m-th prime, if k exists; 0 otherwise.

Table of values

n a(n)
1 3
2 4
3 114
4 852
5 1648
6 1847
7 2500
8 22765
9 54954
10 59930
11 47350
12 971579
13 2183012
14 1945709
15 14424271
16 19139070
17 19517159
18 122815056
19 318016298
20 72732221
21 575945350
22 1020650071
23 3009991871
24 3411065961
25 9193759213
26 847932178
27 310400972174
28 221060379834
29 125367239529
30 426824249940

List of values

[3, 4, 114, 852, 1648, 1847, 2500, 22765, 54954, 59930, 47350, 971579, 2183012, 1945709, 14424271, 19139070, 19517159, 122815056, 318016298, 72732221, 575945350, 1020650071, 3009991871, 3411065961, 9193759213, 847932178, 310400972174, 221060379834, 125367239529, 426824249940]