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.

A050186 Triangular array T read by rows: T(h,k) = number of binary words of k 1's and h-k 0's which are not a juxtaposition of 2 or more identical subwords.

Table of values

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

List of values

[1, 1, 1, 0, 2, 0, 0, 3, 3, 0, 0, 4, 4, 4, 0, 0, 5, 10, 10, 5, 0, 0, 6, 12, 18, 12, 6, 0, 0, 7, 21, 35, 35, 21, 7, 0, 0, 8, 24, 56, 64, 56, 24, 8, 0, 0, 9, 36, 81, 126, 126, 81, 36, 9, 0, 0, 10, 40, 120, 200, 250, 200, 120, 40, 10, 0, 0, 11, 55, 165, 330, 462, 462, 330, 165, 55, 11]