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.

A131872 Set m = 0, n = 1. Find smallest k >= 2 such that pi(k) = (k-pi(k)) - (m-pi(m)); set a(n) = pi(k), m = k, n = n+1. Repeat.

Table of values

n a(n)
1 1
2 4
3 8
4 11
5 16
6 23
7 30
8 39
9 50
10 62
11 78
12 97
13 119
14 141
15 172
16 205
17 242
18 284
19 334
20 393
21 455
22 531
23 615
24 704
25 811
26 928
27 1059
28 1213
29 1373
30 1560
31 1761
32 1988
33 2239
34 2524
35 2833
36 3180
37 3557
38 3983
39 4448
40 4942
41 5503
42 6126
43 6791
44 7522
45 8331
46 9228
47 10188
48 11228

List of values

[1, 4, 8, 11, 16, 23, 30, 39, 50, 62, 78, 97, 119, 141, 172, 205, 242, 284, 334, 393, 455, 531, 615, 704, 811, 928, 1059, 1213, 1373, 1560, 1761, 1988, 2239, 2524, 2833, 3180, 3557, 3983, 4448, 4942, 5503, 6126, 6791, 7522, 8331, 9228, 10188, 11228]