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.

A331942 a(n) = number of primes of the form P(k) = k^2 + 1 <= 10^n as predicted by the Hardy and Littlewood Conjecture F, rounded to nearest integer. The actual number of primes is A083844(n).

Table of values

n a(n)
1 1
2 4
3 9
4 20
5 48
6 121
7 317
8 855
9 2356
10 6609
11 18787
12 53970
13 156385
14 456404
15 1340088
16 3955219
17 11726332
18 34903256
19 104251560
20 312353236
21 938461459
22 2826668497
23 8533343468
24 25814350227
25 78239112814
26 237541788793
27 722354115787
28 2199893807666
29 6708847354653
30 20485514756657

List of values

[1, 4, 9, 20, 48, 121, 317, 855, 2356, 6609, 18787, 53970, 156385, 456404, 1340088, 3955219, 11726332, 34903256, 104251560, 312353236, 938461459, 2826668497, 8533343468, 25814350227, 78239112814, 237541788793, 722354115787, 2199893807666, 6708847354653, 20485514756657]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.