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.

A222769 T(n,k)=Number of nXk 0..1 arrays with exactly floor(nXk/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..1 order.

Table of values

n a(n)
1 1
2 0
3 0
4 0
5 3
6 0
7 3
8 4
9 4
10 0
11 4
12 11
13 13
14 20
15 0
16 4
17 18
18 66
19 96
20 48
21 0
22 5
23 73
24 158
25 465
26 301
27 175
28 0
29 20
30 152
31 934
32 2608
33 3431
34 2242
35 512
36 0
37 27
38 470
39 2446
40 15077
41 19766
42 25772
43 7575
44 1719
45 0
46 48
47 1022
48 14567
49 89811
50 256546
51 333978
52 196185
53 55958
54 5400
55 0
56 63
57 3361
58 39972

List of values

[1, 0, 0, 0, 3, 0, 3, 4, 4, 0, 4, 11, 13, 20, 0, 4, 18, 66, 96, 48, 0, 5, 73, 158, 465, 301, 175, 0, 20, 152, 934, 2608, 3431, 2242, 512, 0, 27, 470, 2446, 15077, 19766, 25772, 7575, 1719, 0, 48, 1022, 14567, 89811, 256546, 333978, 196185, 55958, 5400, 0, 63, 3361, 39972]

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

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