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.

A343139 Numbers k that satisfy the condition digitsum(k) = digitsum(pi(k)) where pi is the prime counting function.

Table of values

n a(n)
1 15
2 27
3 51
4 63
5 120
6 130
7 131
8 142
9 153
10 164
11 208
12 218
13 230
14 242
15 252
16 262
17 263
18 274
19 305
20 318
21 327
22 338
23 348
24 360
25 370
26 381
27 392
28 413
29 424
30 435
31 446
32 456
33 457
34 702
35 712
36 722
37 732
38 805
39 860
40 901
41 912
42 922
43 932
44 1016
45 1027
46 1038
47 1039
48 1048
49 1049
50 1059
51 1071
52 1080

List of values

[15, 27, 51, 63, 120, 130, 131, 142, 153, 164, 208, 218, 230, 242, 252, 262, 263, 274, 305, 318, 327, 338, 348, 360, 370, 381, 392, 413, 424, 435, 446, 456, 457, 702, 712, 722, 732, 805, 860, 901, 912, 922, 932, 1016, 1027, 1038, 1039, 1048, 1049, 1059, 1071, 1080]