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.

A060400 In base ten, we try to get the digits 0,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)
0 101
1 103
2 127
3 131
4 149
5 151
6 163
7 167
8 181
9 191
10 307
11 311
12 421
13 431
14 433
15 457
16 461
17 467
18 487
19 491
20 503
21 521
22 523
23 563
24 641
25 653
26 659
27 673
28 683
29 691
30 701
31 719
32 727
33 733
34 743
35 751
36 761
37 769
38 787
39 797
40 809
41 811
42 821
43 823
44 941
45 953
46 967
47 971
48 983
49 991
50 1009

List of values

[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, 941, 953, 967, 971, 983, 991, 1009]