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.

A060399 In base ten, we try to get the digits 1,2,3,...,9,0,1,2,3,... in order only using a sequence of increasing primes and each time choosing the smallest prime that will give the desired digit.

Table of values

n a(n)
1 11
2 23
3 31
4 41
5 53
6 61
7 67
8 83
9 89
10 101
11 103
12 127
13 131
14 149
15 151
16 163
17 167
18 181
19 191
20 307
21 311
22 421
23 431
24 433
25 457
26 461
27 467
28 487
29 491
30 503
31 521
32 523
33 563
34 641
35 653
36 659
37 673
38 683
39 691
40 701
41 719
42 727
43 733
44 743
45 751
46 761
47 769
48 787
49 797
50 809
51 811
52 821
53 823

List of values

[11, 23, 31, 41, 53, 61, 67, 83, 89, 101, 103, 127, 131, 149, 151, 163, 167, 181, 191, 307, 311, 421, 431, 433, 457, 461, 467, 487, 491, 503, 521, 523, 563, 641, 653, 659, 673, 683, 691, 701, 719, 727, 733, 743, 751, 761, 769, 787, 797, 809, 811, 821, 823]

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

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