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.

A120933 Triangle read by rows: T(n,k) is the number of binary words of length n for which the length of the maximal leading nondecreasing subword is k (1<=k<=n).

Table of values

n a(n)
1 2
2 1
3 3
4 2
5 2
6 4
7 4
8 4
9 3
10 5
11 8
12 8
13 6
14 4
15 6
16 16
17 16
18 12
19 8
20 5
21 7
22 32
23 32
24 24
25 16
26 10
27 6
28 8
29 64
30 64
31 48
32 32
33 20
34 12
35 7
36 9
37 128
38 128
39 96
40 64
41 40
42 24
43 14
44 8
45 10
46 256
47 256
48 192
49 128
50 80
51 48
52 28
53 16
54 9
55 11
56 512
57 512
58 384
59 256
60 160
61 96
62 56
63 32
64 18
65 10
66 12
67 1024
68 1024
69 768
70 512
71 320

List of values

[2, 1, 3, 2, 2, 4, 4, 4, 3, 5, 8, 8, 6, 4, 6, 16, 16, 12, 8, 5, 7, 32, 32, 24, 16, 10, 6, 8, 64, 64, 48, 32, 20, 12, 7, 9, 128, 128, 96, 64, 40, 24, 14, 8, 10, 256, 256, 192, 128, 80, 48, 28, 16, 9, 11, 512, 512, 384, 256, 160, 96, 56, 32, 18, 10, 12, 1024, 1024, 768, 512, 320]