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.

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

Table of values

n a(n)
0 101
1 11
2 2
3 3
4 41
5 5
6 61
7 7
8 83
9 19
10 101
11 11
12 2
13 3
14 41
15 5
16 61
17 7
18 83
19 19
20 101
21 11
22 2
23 3
24 41
25 5
26 61
27 7
28 83
29 19
30 101
31 11
32 2
33 3
34 41
35 5
36 61
37 7
38 83
39 19
40 101
41 11
42 2
43 3
44 41
45 5
46 61
47 7
48 83
49 19
50 101
51 11
52 2
53 3
54 41
55 5
56 61
57 7
58 83
59 19
60 101

List of values

[101, 11, 2, 3, 41, 5, 61, 7, 83, 19, 101, 11, 2, 3, 41, 5, 61, 7, 83, 19, 101, 11, 2, 3, 41, 5, 61, 7, 83, 19, 101, 11, 2, 3, 41, 5, 61, 7, 83, 19, 101, 11, 2, 3, 41, 5, 61, 7, 83, 19, 101, 11, 2, 3, 41, 5, 61, 7, 83, 19, 101]

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

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