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.

A292506 Number T(n,k) of multisets of exactly k nonempty binary words with a total of n letters such that no word has a majority of 0's; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 3
5 1
6 0
7 4
8 3
9 1
10 0
11 11
12 10
13 3
14 1
15 0
16 16
17 23
18 10
19 3
20 1
21 0
22 42
23 59
24 33
25 10
26 3
27 1
28 0
29 64
30 134
31 83
32 33
33 10
34 3
35 1
36 0
37 163
38 320
39 230
40 98
41 33
42 10
43 3
44 1
45 0
46 256
47 699
48 568
49 270
50 98
51 33
52 10
53 3
54 1
55 0
56 638
57 1599
58 1451
59 738
60 291
61 98
62 33
63 10
64 3
65 1
66 0
67 1024
68 3434
69 3439
70 1935
71 798
72 291
73 98
74 33
75 10
76 3
77 1

List of values

[1, 0, 1, 0, 3, 1, 0, 4, 3, 1, 0, 11, 10, 3, 1, 0, 16, 23, 10, 3, 1, 0, 42, 59, 33, 10, 3, 1, 0, 64, 134, 83, 33, 10, 3, 1, 0, 163, 320, 230, 98, 33, 10, 3, 1, 0, 256, 699, 568, 270, 98, 33, 10, 3, 1, 0, 638, 1599, 1451, 738, 291, 98, 33, 10, 3, 1, 0, 1024, 3434, 3439, 1935, 798, 291, 98, 33, 10, 3, 1]