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.

A076449 Least number whose digits can be used to form exactly n different primes (not necessarily using all digits).

Table of values

n a(n)
0 1
1 2
2 25
3 13
4 37
5 107
6 127
7 113
8 167
9 1027
10 179
11 137
12 1036
13 1127
14 1013
15 1137
16 1235
17 1136
18 1123
19 1037
20 1139
21 1079
22 10124
23 10126
24 1349
25 1279
26 1237
27 3479
28 10699
29 1367
30 10179
31 1379
32 10127
33 10079
34 10138
35 10123
36 10234
37 10235
38 10247
39 10339
40 10267

List of values

[1, 2, 25, 13, 37, 107, 127, 113, 167, 1027, 179, 137, 1036, 1127, 1013, 1137, 1235, 1136, 1123, 1037, 1139, 1079, 10124, 10126, 1349, 1279, 1237, 3479, 10699, 1367, 10179, 1379, 10127, 10079, 10138, 10123, 10234, 10235, 10247, 10339, 10267]