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.

A261173 Table read by antidiagonals: T(n,k) = smallest prime p containing only digits 0 and 1 with n 0's and k 1's, or 0 if no such p exists.

Table of values

n a(n)
0 11
1 0
2 101
3 0
4 0
5 0
6 0
7 10111
8 0
9 0
10 0
11 101111
12 0
13 0
14 0
15 0
16 0
17 0
18 1011001
19 0
20 0
21 0
22 11110111
23 0
24 10011101
25 10010101
26 0
27 0
28 0
29 101111111
30 101101111
31 0
32 100100111
33 101001001
34 0
35 0
36 0
37 0
38 1010111111
39 1001110111
40 0
41 1000011011
42 1000001011
43 0
44 0

List of values

[11, 0, 101, 0, 0, 0, 0, 10111, 0, 0, 0, 101111, 0, 0, 0, 0, 0, 0, 1011001, 0, 0, 0, 11110111, 0, 10011101, 10010101, 0, 0, 0, 101111111, 101101111, 0, 100100111, 101001001, 0, 0, 0, 0, 1010111111, 1001110111, 0, 1000011011, 1000001011, 0, 0]