A302367 -id:A302367 - cp's OEIS frontend

A302368 Number of 2Xn 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

2, 2, 12, 20, 72, 168, 496, 1296, 3616, 9760, 26816, 73024, 199808, 545408, 1490688, 4071680, 11125248, 30392832, 83037184, 226857984, 619792384, 1693296640, 4626182144, 12638949376, 34530271232, 94338424832, 257737408512

Offset: 1

R. H. Hardin, Apr 06 2018

nonn

Row 2 of A302367.

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

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

Cf. A302367.

Empirical: a(n) = 2*a(n-1) +4*a(n-2) -4*a(n-3) -4*a(n-4)

A302362 Number of nX3 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

1, 12, 31, 109, 397, 1430, 5110, 18395, 66203, 238103, 856413, 3081033, 11083994, 39873749, 143444250, 516038048, 1856433397, 6678469130, 24025629692, 86431623758, 310935653685, 1118583441105, 4024076800534, 14476518656548

Offset: 1

R. H. Hardin, Apr 06 2018

nonn

Column 3 of A302367.

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

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

Cf. A302367.

Empirical: a(n) = 4*a(n-1) -3*a(n-2) +9*a(n-3) -9*a(n-4) -11*a(n-5) +a(n-6) -18*a(n-7) +16*a(n-8) -12*a(n-9) -4*a(n-10) +4*a(n-11) +8*a(n-12)

A302363 Number of nX4 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

1, 20, 20, 77, 209, 774, 3143, 13556, 60280, 272792, 1243804, 5692133, 26100174, 119782344, 549950950, 2525484907, 11598683442, 53271277746, 244673796303, 1123793697954, 5161643580014, 23707760958131, 108891405413647

Offset: 1

R. H. Hardin, Apr 06 2018

nonn

Column 4 of A302367.

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

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

Cf. A302367.

Empirical: a(n) = 6*a(n-1) -7*a(n-2) +10*a(n-3) -30*a(n-4) -21*a(n-5) -3*a(n-6) -68*a(n-7) +280*a(n-8) +414*a(n-9) +164*a(n-10) -423*a(n-11) -1527*a(n-12) +833*a(n-13) +1714*a(n-14) -2022*a(n-15) -1901*a(n-16) +367*a(n-17) +2024*a(n-18) +923*a(n-19) +66*a(n-20) -142*a(n-21) -5380*a(n-22) +4543*a(n-23) +13152*a(n-24) -11763*a(n-25) -12833*a(n-26) +16700*a(n-27) +4765*a(n-28) -15572*a(n-29) +1243*a(n-30) +9288*a(n-31) -3398*a(n-32) -4331*a(n-33) +2341*a(n-34) +1523*a(n-35) -1099*a(n-36) -619*a(n-37) +631*a(n-38) +476*a(n-39) -262*a(n-40) -191*a(n-41) +217*a(n-42) -15*a(n-43) -90*a(n-44) +18*a(n-45) +6*a(n-46) -14*a(n-47) +4*a(n-48) +6*a(n-49) -2*a(n-50) for n>53

A302364 Number of nX5 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

1, 72, 154, 918, 6580, 49293, 367512, 2856621, 22185382, 172716970, 1347540710, 10518804501, 82131380313, 641409831341, 5009453613390, 39125509173987, 305589139123276, 2386818398723114, 18642433335189313, 145608500721079409

Offset: 1

R. H. Hardin, Apr 06 2018

nonn

Column 5 of A302367.

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

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

Cf. A302367.

A302365 Number of nX6 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

1, 168, 284, 3125, 26458, 330505, 3858625, 48375470, 608124211, 7645706001, 96379576670, 1215653208094, 15330813861321, 193363893550173, 2439014211176791, 30764225158027102, 388042002523348294

Offset: 1

R. H. Hardin, Apr 06 2018

nonn

Column 6 of A302367.

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

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

Cf. A302367.

A302366 Number of nX7 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

1, 496, 1109, 21831, 405340, 9361759, 188443738, 4174802035, 91302504318, 1990647394962, 43458424036759, 950882891683727, 20782195034545859, 454232197608277559, 9930143090303194255, 217079454443097601597

Offset: 1

R. H. Hardin, Apr 06 2018

nonn

Column 7 of A302367.

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

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

Cf. A302367.

A302369 Number of 3Xn 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

4, 2, 31, 20, 154, 284, 1109, 3472, 12763, 48721, 190256, 770983, 3134572, 12931018, 53433431, 221779682, 921445395, 3833216521, 15953742306, 66423173327, 276603513242, 1151978426752, 4797997758989, 19984422198978, 83240190604547

Offset: 1

R. H. Hardin, Apr 06 2018

nonn

Row 3 of A302367.

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

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

Cf. A302367.

Empirical: a(n) = 6*a(n-1) +a(n-2) -47*a(n-3) +13*a(n-4) +158*a(n-5) -30*a(n-6) -242*a(n-7) -62*a(n-8) +224*a(n-9) +26*a(n-10) +11*a(n-11) +64*a(n-12) -114*a(n-13) -27*a(n-14) +26*a(n-15) -6*a(n-16) for n>18

A302370 Number of 4Xn 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

8, 3, 109, 77, 918, 3125, 21831, 125193, 824459, 5383504, 35779184, 240480550, 1615536651, 10916466595, 73707212142, 498626574631, 3372684616301, 22824815728427, 154471448375476, 1045558911080013, 7077203544387174

Offset: 1

R. H. Hardin, Apr 06 2018

nonn

Row 4 of A302367.

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

R. H. Hardin, Table of n, a(n) for n = 1..210
R. H. Hardin, Empirical recurrence of order 63

Cf. A302367.

Empirical recurrence of order 63 (see link above)

A302371 Number of 5Xn 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

16, 6, 397, 209, 6580, 26458, 405340, 3462040, 41451287, 458150190, 5345696079, 62248870169, 729804695624, 8580310210250, 100969181068120, 1189454516588708, 14015983416421641, 165203770204722957, 1947463456028707595

Offset: 1

R. H. Hardin, Apr 06 2018

nonn

Row 5 of A302367.

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

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

Cf. A302367.

A302372 Number of 6Xn 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

32, 10, 1430, 774, 49293, 330505, 9361759, 134269527, 2825903917, 54054532568, 1092422233481, 22007062663066, 445934906883244, 9061049034536850, 184230706405562446, 3749236916366246041, 76322340837084500948

Offset: 1

R. H. Hardin, Apr 06 2018

nonn

Row 6 of A302367.

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

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

Cf. A302367.

cp's OEIS Frontend

A302368 Number of 2Xn 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A302362 Number of nX3 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A302363 Number of nX4 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A302364 Number of nX5 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A302365 Number of nX6 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A302366 Number of nX7 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A302369 Number of 3Xn 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A302370 Number of 4Xn 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A302371 Number of 5Xn 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A302372 Number of 6Xn 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Views