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.

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

Table of values

n a(n)
1 10
2 150
3 30
4 2338
5 486
6 85
7 36814
8 7862
9 1597
10 246
11 582440
12 126606
13 27024
14 5211
15 707
16 9240426
17 2034200
18 445780
19 93308
20 16649
21 2037
22 146861788
23 32644314
24 7274268
25 1581686
26 321320
27 53553
28 5864
29 2337014158
30 523487828
31 118029501
32 26242268

List of values

[10, 150, 30, 2338, 486, 85, 36814, 7862, 1597, 246, 582440, 126606, 27024, 5211, 707, 9240426, 2034200, 445780, 93308, 16649, 2037, 146861788, 32644314, 7274268, 1581686, 321320, 53553, 5864, 2337014158, 523487828, 118029501, 26242268]