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.

A385996 a(n) is the least k such that some value appears n times among A002487(0), ..., A002487(k).

Table of values

n a(n)
1 0
2 2
3 4
4 8
5 16
6 28
7 34
8 44
9 52
10 62
11 68
12 88
13 104
14 124
15 130
16 152
17 184
18 200
19 232
20 250
21 260
22 296
23 328
24 380
25 388
26 440
27 472
28 500
29 524
30 568
31 632
32 688
33 764
34 772
35 848
36 904
37 968
38 1012
39 1030
40 1064
41 1144
42 1232
43 1288
44 1424
45 1534
46 1538
47 1648
48 1784
49 1840
50 1928
51 2008
52 2038

List of values

[0, 2, 4, 8, 16, 28, 34, 44, 52, 62, 68, 88, 104, 124, 130, 152, 184, 200, 232, 250, 260, 296, 328, 380, 388, 440, 472, 500, 524, 568, 632, 688, 764, 772, 848, 904, 968, 1012, 1030, 1064, 1144, 1232, 1288, 1424, 1534, 1538, 1648, 1784, 1840, 1928, 2008, 2038]