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.

A351645 Triangle read by rows: T(n,k) is the number of length n word structures using exactly k different symbols with all distinct run-lengths and the first run length of a symbol less than that of previous symbols, n >= 0, k = 0..floor(sqrt(8*n+1)-1/2).

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 0
6 1
7 1
8 0
9 1
10 1
11 0
12 1
13 2
14 0
15 1
16 5
17 1
18 0
19 1
20 6
21 1
22 0
23 1
24 9
25 2
26 0
27 1
28 13
29 3
30 0
31 1
32 28
33 16
34 1
35 0
36 1
37 32
38 17
39 1
40 0
41 1
42 50
43 31
44 2
45 0
46 1
47 66
48 44
49 3
50 0
51 1
52 96
53 70
54 5
55 0
56 1
57 175
58 224
59 36
60 1
61 0
62 1
63 217
64 262
65 39
66 1
67 0
68 1
69 308
70 428
71 71
72 2
73 0
74 1
75 425
76 619
77 105
78 3

List of values

[1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 2, 0, 1, 5, 1, 0, 1, 6, 1, 0, 1, 9, 2, 0, 1, 13, 3, 0, 1, 28, 16, 1, 0, 1, 32, 17, 1, 0, 1, 50, 31, 2, 0, 1, 66, 44, 3, 0, 1, 96, 70, 5, 0, 1, 175, 224, 36, 1, 0, 1, 217, 262, 39, 1, 0, 1, 308, 428, 71, 2, 0, 1, 425, 619, 105, 3]