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.

A208741 Triangular array read by rows. T(n,k) is the number of sets of exactly k distinct binary words with a total of n letters.

Table of values

n a(n)
1 2
2 4
3 1
4 8
5 8
6 16
7 22
8 4
9 32
10 64
11 20
12 64
13 156
14 84
15 6
16 128
17 384
18 264
19 40
20 256
21 888
22 784
23 189
24 4
25 512
26 2048
27 2152
28 704
29 50
30 1024
31 4592
32 5664
33 2384
34 272
35 1
36 2048
37 10240
38 14368
39 7328
40 1232
41 32
42 4096
43 22496
44 35568
45 21382
46 4704
47 248

List of values

[2, 4, 1, 8, 8, 16, 22, 4, 32, 64, 20, 64, 156, 84, 6, 128, 384, 264, 40, 256, 888, 784, 189, 4, 512, 2048, 2152, 704, 50, 1024, 4592, 5664, 2384, 272, 1, 2048, 10240, 14368, 7328, 1232, 32, 4096, 22496, 35568, 21382, 4704, 248]