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.

A048004 Triangular array read by rows: T(n,k) = number of binary vectors of length n whose longest run of consecutive 1's has length k, for n >= 0, 0 <= k <= n.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 1
6 1
7 4
8 2
9 1
10 1
11 7
12 5
13 2
14 1
15 1
16 12
17 11
18 5
19 2
20 1
21 1
22 20
23 23
24 12
25 5
26 2
27 1
28 1
29 33
30 47
31 27
32 12
33 5
34 2
35 1
36 1
37 54
38 94
39 59
40 28
41 12
42 5
43 2
44 1
45 1
46 88
47 185
48 127
49 63
50 28
51 12
52 5
53 2
54 1
55 1
56 143
57 360
58 269
59 139
60 64
61 28
62 12
63 5
64 2
65 1
66 1
67 232
68 694
69 563
70 303
71 143
72 64
73 28
74 12
75 5
76 2
77 1
78 1
79 376
80 1328
81 1167
82 653
83 315
84 144
85 64
86 28
87 12
88 5
89 2
90 1

List of values

[1, 1, 1, 1, 2, 1, 1, 4, 2, 1, 1, 7, 5, 2, 1, 1, 12, 11, 5, 2, 1, 1, 20, 23, 12, 5, 2, 1, 1, 33, 47, 27, 12, 5, 2, 1, 1, 54, 94, 59, 28, 12, 5, 2, 1, 1, 88, 185, 127, 63, 28, 12, 5, 2, 1, 1, 143, 360, 269, 139, 64, 28, 12, 5, 2, 1, 1, 232, 694, 563, 303, 143, 64, 28, 12, 5, 2, 1, 1, 376, 1328, 1167, 653, 315, 144, 64, 28, 12, 5, 2, 1]