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.

A261019 Irregular triangle read by rows: T(n,k) (0 <= k <= A261017(n)) = number of binary strings of length n such that the smallest number whose binary representation is not visible in the string is k.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 2
10 3
11 1
12 1
13 1
14 3
15 6
16 4
17 1
18 1
19 1
20 4
21 11
22 10
23 5
24 1
25 1
26 5
27 19
28 21
29 15
30 0
31 2
32 1
33 1
34 6
35 32
36 40
37 35
38 2
39 9
40 2
41 1
42 1
43 7
44 53
45 72
46 73
47 6
48 31
49 10
50 2
51 1
52 1
53 8
54 87
55 125
56 144
57 15
58 79
59 40
60 12
61 1
62 1
63 9
64 142
65 212
66 274
67 32
68 185
69 116
70 52
71 1
72 1
73 10
74 231
75 354
76 509
77 64
78 408
79 296
80 168
81 2
82 4

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 3, 6, 4, 1, 1, 1, 4, 11, 10, 5, 1, 1, 5, 19, 21, 15, 0, 2, 1, 1, 6, 32, 40, 35, 2, 9, 2, 1, 1, 7, 53, 72, 73, 6, 31, 10, 2, 1, 1, 8, 87, 125, 144, 15, 79, 40, 12, 1, 1, 9, 142, 212, 274, 32, 185, 116, 52, 1, 1, 10, 231, 354, 509, 64, 408, 296, 168, 2, 4]