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.

A212232 T(n,k)=Number of 0..2 arrays of length n+2*k-1 with sum no more than 2*k in any length 2k subsequence (=50% duty cycle).

Table of values

n a(n)
1 6
2 50
3 14
4 435
5 124
6 31
7 3834
8 1113
9 311
10 70
11 34001
12 10002
13 2902
14 775
15 157
16 302615
17 89911
18 26637
19 7596
20 1895
21 353
22 2699598
23 808403
24 242780
25 71427
26 19834
27 4663
28 793
29 24121674
30 7269626
31 2204646
32 660796
33 191853
34 51440
35 11518
36 1782
37 215786649

List of values

[6, 50, 14, 435, 124, 31, 3834, 1113, 311, 70, 34001, 10002, 2902, 775, 157, 302615, 89911, 26637, 7596, 1895, 353, 2699598, 808403, 242780, 71427, 19834, 4663, 793, 24121674, 7269626, 2204646, 660796, 191853, 51440, 11518, 1782, 215786649]