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.

A283838 Irregular triangle read by rows: T(n,k) (n >= 8, 3 <= k <= floor(n/2)-1) = number of binary vectors of length <= n that start with 1^k, 0, end with 1, 0^k, and the factor between 1^k and 0^k does not contain 0^k or 1^k.

Table of values

n a(n)
8 1
9 3
10 5
11 1
12 9
13 3
14 16
15 7
16 1
17 26
18 13
19 3
20 43
21 25
22 7
23 1
24 71
25 47
26 15
27 3
28 115
29 88
30 29
31 7
32 1
33 187
34 162
35 57
36 15
37 3
38 304
39 299
40 111
41 31
42 7
43 1
44 492
45 551
46 215
47 61
48 15
49 3
50 797
51 1015
52 416
53 121
54 31
55 7
56 1
57 1291
58 1867
59 802
60 239
61 63
62 15
63 3
64 2089
65 3435
66 1547
67 471
68 125
69 31
70 7
71 1
72 3381
73 6319
74 2983
75 927
76 249
77 63
78 15
79 3

List of values

[1, 3, 5, 1, 9, 3, 16, 7, 1, 26, 13, 3, 43, 25, 7, 1, 71, 47, 15, 3, 115, 88, 29, 7, 1, 187, 162, 57, 15, 3, 304, 299, 111, 31, 7, 1, 492, 551, 215, 61, 15, 3, 797, 1015, 416, 121, 31, 7, 1, 1291, 1867, 802, 239, 63, 15, 3, 2089, 3435, 1547, 471, 125, 31, 7, 1, 3381, 6319, 2983, 927, 249, 63, 15, 3]