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.

A360693 Number T(n,k) of sets of n words of length n over binary alphabet where the first letter occurs k times; triangle T(n,k), n>=0, n-signum(n)<=k<=n*(n-1)+signum(n), read by rows.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 2
5 2
6 3
7 10
8 15
9 15
10 10
11 3
12 4
13 37
14 108
15 228
16 336
17 394
18 336
19 228
20 108
21 37
22 4
23 5
24 101
25 600
26 2150
27 5645
28 11680
29 19752
30 27820
31 32935
32 32935
33 27820
34 19752
35 11680
36 5645
37 2150
38 600
39 101
40 5
41 6
42 226
43 2490
44 14745
45 61770
46 200529
47 535674
48 1211485
49 2368200

List of values

[1, 1, 1, 2, 2, 2, 3, 10, 15, 15, 10, 3, 4, 37, 108, 228, 336, 394, 336, 228, 108, 37, 4, 5, 101, 600, 2150, 5645, 11680, 19752, 27820, 32935, 32935, 27820, 19752, 11680, 5645, 2150, 600, 101, 5, 6, 226, 2490, 14745, 61770, 200529, 535674, 1211485, 2368200]