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.

A183772 T(n,k) = 1/32 the number of (n+1) X (k+1) binary arrays with equal numbers of 2 X 2 subblocks with sum mod two being 0 and 1.

Table of values

n a(n)
1 0
2 1
3 1
4 0
5 6
6 0
7 12
8 40
9 40
10 12
11 0
12 280
13 0
14 280
15 0
16 160
17 2016
18 7392
19 7392
20 2016
21 160
22 0
23 14784
24 0
25 205920
26 0
27 14784
28 0
29 2240
30 109824
31 1555840
32 5912192
33 5912192
34 1555840
35 109824
36 2240
37 0
38 823680
39 0
40 173065984
41 0
42 173065984
43 0
44 823680
45 0
46 32256
47 6223360

List of values

[0, 1, 1, 0, 6, 0, 12, 40, 40, 12, 0, 280, 0, 280, 0, 160, 2016, 7392, 7392, 2016, 160, 0, 14784, 0, 205920, 0, 14784, 0, 2240, 109824, 1555840, 5912192, 5912192, 1555840, 109824, 2240, 0, 823680, 0, 173065984, 0, 173065984, 0, 823680, 0, 32256, 6223360]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.