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.

A168588 Smallest p(n)-digit prime with digit sum n, and made up of digits 0 and 1 only, where p(n)=A000040(n) (or 0, if no such prime exists).

Table of values

n a(n)
1 0
2 101
3 0
4 1011001
5 10000110011
6 0
7 10000000010101111
8 1000000000001111111
9 0
10 10000000000000000101101111101
11 1000000000000000000011111110111
12 0
13 10000000000000000000000000011111111110101
14 1000000000000000000000000000110111111011111

List of values

[0, 101, 0, 1011001, 10000110011, 0, 10000000010101111, 1000000000001111111, 0, 10000000000000000101101111101, 1000000000000000000011111110111, 0, 10000000000000000000000000011111111110101, 1000000000000000000000000000110111111011111]

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

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