A220328 -id:A220328 - cp's OEIS frontend

A220324 Equals two maps: number of n X 3 binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 n X 3 array.

2, 16, 92, 508, 2788, 15316, 84196, 462940, 2545492, 13996468, 76959844, 423164812, 2326777444, 12793817140, 70346976484, 386803802332, 2126845944052, 11694491219668, 64302318307108, 353567167818892, 1944093859291588

Offset: 1

R. H. Hardin, Dec 10 2012

nonn

Column 3 of A220328.

			Some solutions for n=3:
..0..1..1....0..1..1....0..1..1....0..0..1....0..0..0....0..0..1....0..0..0
..1..0..1....0..1..0....0..0..0....0..1..1....1..1..0....1..0..1....0..0..1
..0..0..0....1..1..0....0..0..0....0..0..0....1..1..0....0..0..0....0..1..0

R. H. Hardin, Table of n, a(n) for n = 1..210

Cf. A220328.

Empirical: a(n) = 7*a(n-1) - 9*a(n-2) + 3*a(n-3) + 6*a(n-4).

Empirical g.f.: 2*x*(1 + x - x^2 + x^3) / (1 - 7*x + 9*x^2 - 3*x^3 - 6*x^4). - Colin Barker, Jul 31 2018

A220325 Equals two maps: number of nX4 binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 nX4 array.

Original entry on oeis.org

4, 48, 572, 6657, 76627, 876714, 10004541, 114058230, 1299991681, 14816159113, 168863397427, 1924606619479, 21935746576784, 250014218249170, 2849559239020408, 32478119824983512, 370172462886188547

Offset: 1

R. H. Hardin Dec 10 2012

nonn

Column 4 of A220328

			Some solutions for n=3
..0..0..0..1....0..0..1..0....0..0..0..1....0..0..1..1....0..1..1..0
..1..1..1..1....0..0..0..1....1..1..1..0....0..0..1..0....0..1..1..1
..1..0..1..0....0..0..0..0....1..1..1..0....0..1..1..0....0..0..0..0

R. H. Hardin, Table of n, a(n) for n = 1..210

Empirical: a(n) = 52*a(n-1) -1250*a(n-2) +18642*a(n-3) -194453*a(n-4) +1512860*a(n-5) -9129049*a(n-6) +43823835*a(n-7) -170215806*a(n-8) +540993502*a(n-9) -1417406111*a(n-10) +3076408923*a(n-11) -5554889698*a(n-12) +8398935833*a(n-13) -10787536090*a(n-14) +12135358811*a(n-15) -12598845224*a(n-16) +12820387027*a(n-17) -13258166832*a(n-18) +14036219536*a(n-19) -15126263888*a(n-20) +15968958579*a(n-21) -15322438978*a(n-22) +12752922922*a(n-23) -9963260043*a(n-24) +8938384993*a(n-25) -9062026289*a(n-26) +8132182176*a(n-27) -5833978765*a(n-28) +3839464387*a(n-29) -2914935368*a(n-30) +2269830690*a(n-31) -1376357333*a(n-32) +584276484*a(n-33) -210575330*a(n-34) +122997352*a(n-35) -93676127*a(n-36) +53337463*a(n-37) -20323630*a(n-38) +4959164*a(n-39) -1342573*a(n-40) +1282335*a(n-41) -871329*a(n-42) +302448*a(n-43) -65056*a(n-44) +9552*a(n-45) -576*a(n-46) for n>47

A220329 Equals two maps: number of 2Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 2Xn array.

Original entry on oeis.org

1, 4, 16, 48, 174, 658, 2482, 9229, 33982, 125217, 461351, 1699127, 6252129, 22995280, 84546207, 310785413, 1142206689, 4197260747, 15421867303, 56659522539, 208152496049, 764662949438, 2808941077111, 10318186228202

Offset: 1

R. H. Hardin Dec 10 2012

nonn

Row 2 of A220328

			Some solutions for n=3
..0..1..0....0..0..1....0..0..0....0..0..1....0..1..1....0..1..1....0..1..0
..0..0..0....1..0..0....0..1..0....0..0..0....0..1..0....1..1..0....1..1..0

R. H. Hardin, Table of n, a(n) for n = 1..210

A220330 Equals two maps: number of 3Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 3Xn array.

Original entry on oeis.org

1, 12, 92, 572, 4062, 29467, 213225, 1540686, 11163495, 80656708, 581473349, 4190483128, 30199355040, 217538559602, 1566825952174, 11283025994195, 81236036737903, 584831754731217, 4210022381269251, 30304818855812080

Offset: 1

R. H. Hardin Dec 10 2012

nonn

Row 3 of A220328

			Some solutions for n=3
..0..1..0....0..0..0....0..0..0....0..1..1....0..1..0....0..1..0....0..0..0
..0..1..0....1..0..1....1..1..0....0..1..0....0..1..1....1..1..0....0..0..1
..0..0..0....1..1..0....0..1..0....1..1..0....0..0..0....0..1..0....0..1..0

R. H. Hardin, Table of n, a(n) for n = 1..22

A220326 Equals two maps: number of nX5 binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 nX5 array.

Original entry on oeis.org

7, 174, 4062, 92093, 2065264, 46094354, 1026529800, 22841390408, 508110710307, 11302385499363, 251409042152240, 5592331837970994, 124395540371693940, 2767041352339397099

Offset: 1

R. H. Hardin Dec 10 2012

nonn

Column 5 of A220328

			Some solutions for n=3
..0..1..0..0..0....0..1..1..1..1....0..1..0..1..1....0..1..0..0..0
..1..0..0..0..1....0..0..0..1..0....0..0..1..0..0....1..0..1..1..1
..0..1..0..1..0....0..0..0..1..0....0..0..0..1..0....0..0..0..0..0

A220327 Equals two maps: number of nX6 binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 nX6 array.

Original entry on oeis.org

12, 658, 29467, 1335202, 59893608, 2680626797, 119808040854, 5350328821481

Offset: 1

R. H. Hardin Dec 10 2012

nonn

Column 6 of A220328

			Some solutions for n=3
..0..0..1..0..1..0....0..0..0..1..1..0....0..0..0..1..0..1....0..0..0..1..1..0
..1..1..1..1..0..0....0..1..0..0..1..0....0..0..0..1..1..1....1..0..1..1..0..1
..0..1..0..1..0..0....1..1..1..0..1..0....1..0..0..0..1..0....0..1..1..0..1..0

A220331 Equals two maps: number of 4 X n binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 4 X n array.

Original entry on oeis.org

1, 37, 508, 6657, 92093, 1335202, 18836493, 265346645, 3750121527

Offset: 1

R. H. Hardin, Dec 10 2012

nonn

Row 4 of A220328.

			Some solutions for n=3
..0..0..1....0..1..0....0..0..0....0..0..1....0..0..1....0..1..0....0..0..1
..1..0..1....0..1..0....0..1..1....1..0..0....1..1..0....0..1..0....0..0..0
..0..0..1....1..0..0....0..0..0....0..1..0....0..0..1....1..1..1....0..0..0
..1..0..0....0..0..0....0..1..0....0..1..0....0..0..0....0..1..0....1..1..0

Cf. A220328.

A220332 Equals two maps: number of 5Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 5Xn array.

Original entry on oeis.org

1, 114, 2788, 76627, 2065264, 59893608, 1653121774

Offset: 1

R. H. Hardin Dec 10 2012

nonn

Row 5 of A220328

			Some solutions for n=3
..0..0..0....0..0..1....0..0..0....0..1..0....0..1..0....0..1..1....0..0..0
..1..1..0....1..1..0....0..1..0....1..1..0....1..0..1....0..0..0....0..1..0
..0..0..0....0..0..0....0..1..1....1..0..1....1..0..1....0..1..0....0..1..0
..0..1..0....1..1..1....0..1..0....1..0..1....1..0..1....0..1..1....0..1..1
..0..0..0....0..1..0....0..1..0....0..1..0....0..0..0....1..0..0....0..1..0

A220333 Equals two maps: number of 6Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 6Xn array.

Original entry on oeis.org

1, 351, 15316, 876714, 46094354, 2680626797

Offset: 1

R. H. Hardin Dec 10 2012

nonn

Row 6 of A220328

			Some solutions for n=3
..0..0..0....0..0..1....0..0..0....0..1..0....0..1..0....0..1..0....0..0..0
..0..0..1....1..0..0....0..0..0....0..0..1....1..1..1....0..1..0....1..0..0
..1..0..0....0..0..0....0..1..1....1..0..0....0..1..1....1..1..1....0..1..1
..0..0..0....0..0..0....1..0..0....0..1..1....0..1..1....0..1..1....1..0..1
..0..0..0....0..1..0....0..1..0....0..1..0....0..0..0....0..1..0....0..1..1
..1..1..0....0..0..0....0..1..0....1..0..0....0..1..0....0..1..0....0..0..0

A220334 Equals two maps: number of 7Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 7Xn array.

Original entry on oeis.org

1, 1081, 84196, 10004541, 1026529800, 119808040854

Offset: 1

R. H. Hardin Dec 10 2012

nonn

Row 7 of A220328

			Some solutions for n=3
..0..1..0....0..1..0....0..0..0....0..1..0....0..0..1....0..1..1....0..1..1
..0..1..0....1..1..0....0..0..0....0..1..0....1..0..0....0..1..0....0..0..1
..1..0..0....1..0..0....1..1..1....1..0..0....0..0..0....1..1..0....1..0..0
..0..1..1....0..1..0....0..0..0....0..1..1....0..0..0....0..1..0....1..0..0
..1..0..0....0..0..0....0..0..0....1..0..0....0..1..1....1..1..0....0..1..0
..1..0..0....0..0..1....0..0..0....0..0..0....1..0..1....0..1..0....0..0..0
..0..1..0....0..1..0....0..1..0....1..0..0....1..1..0....1..0..0....1..0..0

cp's OEIS Frontend

A220324 Equals two maps: number of n X 3 binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 n X 3 array.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A220325 Equals two maps: number of nX4 binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 nX4 array.

Views

Author

Keywords

Comments

Examples

Links

Formula

A220329 Equals two maps: number of 2Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 2Xn array.

Views

Author

Keywords

Comments

Examples

Links

A220330 Equals two maps: number of 3Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 3Xn array.

Views

Author

Keywords

Comments

Examples

Links

A220326 Equals two maps: number of nX5 binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 nX5 array.

Views

Author

Keywords

Comments

Examples

A220327 Equals two maps: number of nX6 binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 nX6 array.

Views

Author

Keywords

Comments

Examples

A220331 Equals two maps: number of 4 X n binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 4 X n array.

Views

Author

Keywords

Comments

Examples

Crossrefs

A220332 Equals two maps: number of 5Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 5Xn array.

Views

Author

Keywords

Comments

Examples

A220333 Equals two maps: number of 6Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 6Xn array.

Views

Author

Keywords

Comments

Examples

A220334 Equals two maps: number of 7Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 7Xn array.

Views

Author

Keywords

Comments

Examples