A302265 -id:A302265 - cp's OEIS frontend

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

2, 8, 29, 105, 384, 1405, 5135, 18766, 68589, 250693, 916272, 3348929, 12240187, 44737350, 163513041, 597632937, 2184322000, 7983600501, 29179707415, 106650542494, 389803024901, 1424712848861, 5207262571120, 19032314831801

Offset: 1

R. H. Hardin, Apr 04 2018

nonn

Row 2 of A302265.

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

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

Cf. A302265.

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

A302260 Number of n X 3 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

4, 29, 153, 818, 4386, 23516, 126162, 676988, 3632880, 19495940, 104627364, 561499304, 3013389264, 16171937024, 86789899608, 465775377536, 2499677308656, 13415022525008, 71994427701360, 386372643782240, 2073546883713888

Offset: 1

R. H. Hardin, Apr 04 2018

nonn

Column 3 of A302265.

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

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

Cf. A302265.

Empirical: a(n) = 6*a(n-1) -2*a(n-2) +2*a(n-3) -54*a(n-4) +16*a(n-5) for n>6.

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

Original entry on oeis.org

8, 105, 772, 5922, 45717, 353229, 2727755, 21069318, 162753849, 1257225302, 9711792270, 75021745843, 579529894725, 4476770505137, 34582309009590, 267142643360807, 2063633101348406, 15941227812038514, 123143376763267969

Offset: 1

R. H. Hardin, Apr 04 2018

nonn

Column 4 of A302265.

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

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

Cf. A302265.

Empirical: a(n) = 9*a(n-1) -2*a(n-2) -51*a(n-3) -80*a(n-4) -11*a(n-5) +262*a(n-6) +1203*a(n-7) -73*a(n-8) -847*a(n-9) -3807*a(n-10) +103*a(n-11) -606*a(n-12) +4295*a(n-13) +1436*a(n-14) +1630*a(n-15) -3052*a(n-16) +576*a(n-17) for n>18

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

Original entry on oeis.org

16, 384, 3818, 40296, 429854, 4608075, 49315068, 527911860, 5651844495, 60512022539, 647867830591, 6936433466124, 74265480772198, 795130321189515, 8513145805873382, 91146924218701992, 975874666111418347

Offset: 1

R. H. Hardin, Apr 04 2018

nonn

Column 5 of A302265.

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

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

Cf. A302265.

Empirical recurrence of order 70 (see link above)

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

Original entry on oeis.org

32, 1405, 19191, 284428, 4289139, 64975832, 982041385, 14850510984, 224584502616, 3396894785618, 51378080369692, 777114464739294, 11754193622516512, 177788578767001402, 2689153640060642062

Offset: 1

R. H. Hardin, Apr 04 2018

nonn

Column 6 of A302265.

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

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

Cf. A302265.

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

Original entry on oeis.org

64, 5135, 96004, 1984001, 41994750, 893462062, 18964765818, 402597400706, 8547940665506, 181527035285787, 3854821615967821, 81862339042940669, 1738453613332468089, 36918733850285685708, 784027054636001040433

Offset: 1

R. H. Hardin, Apr 04 2018

nonn

Column 7 of A302265.

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

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

Cf. A302265.

A302267 Number of 3 X n 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

4, 32, 153, 772, 3818, 19191, 96004, 481261, 2411557, 12086268, 60572976, 303579352, 1521476119, 7625336613, 38216661796, 191534345225, 959932146275, 4810989844333, 24111728148027, 120843206657400, 605642220203867

Offset: 1

R. H. Hardin, Apr 04 2018

nonn

Row 3 of A302265.

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

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

Cf. A302265.

Empirical: a(n) = 3*a(n-1) +14*a(n-2) -9*a(n-3) -54*a(n-4) -10*a(n-5) +65*a(n-6) +17*a(n-7) -8*a(n-8) -2*a(n-9) -31*a(n-10) -7*a(n-11) +9*a(n-12) for n>13.

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

Original entry on oeis.org

8, 128, 818, 5922, 40296, 284428, 1984001, 13858979, 96989344, 677924227, 4741556252, 33160693907, 231908861764, 1621957375639, 11343626172102, 79335892155345, 554866483249174, 3880672405834657, 27141030302203992

Offset: 1

R. H. Hardin, Apr 04 2018

nonn

Row 4 of A302265.

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

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

Cf. A302265.

Empirical: a(n) = 5*a(n-1) +37*a(n-2) -87*a(n-3) -705*a(n-4) +490*a(n-5) +6647*a(n-6) -2273*a(n-7) -37443*a(n-8) +18499*a(n-9) +137351*a(n-10) -119456*a(n-11) -307421*a(n-12) +497358*a(n-13) +283070*a(n-14) -1382386*a(n-15) +550943*a(n-16) +2688669*a(n-17) -2529947*a(n-18) -3862337*a(n-19) +4815881*a(n-20) +4396960*a(n-21) -5833953*a(n-22) -4259372*a(n-23) +4902946*a(n-24) +3609580*a(n-25) -2867379*a(n-26) -2613565*a(n-27) +1071860*a(n-28) +1546436*a(n-29) -178195*a(n-30) -696136*a(n-31) -34724*a(n-32) +210182*a(n-33) +28519*a(n-34) -40047*a(n-35) -7799*a(n-36) +6305*a(n-37) +1510*a(n-38) -1015*a(n-39) -211*a(n-40) +30*a(n-41) +22*a(n-42) +12*a(n-43) -4*a(n-44) for n>45.

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

Original entry on oeis.org

16, 512, 4386, 45717, 429854, 4289139, 41994750, 411922598, 4057777774, 39861518663, 392139398276, 3857829901549, 37946634409412, 373356037411323, 3673267587608222, 36140816911747227, 355597872011530803

Offset: 1

R. H. Hardin, Apr 04 2018

nonn

Row 5 of A302265.

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

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

Cf. A302265.

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

Original entry on oeis.org

32, 2048, 23516, 353229, 4608075, 64975832, 893462062, 12314612510, 170772674650, 2358411011162, 32642910388558, 451854951125666, 6252677767027315, 86568880314498494, 1198444427129769914

Offset: 1

R. H. Hardin, Apr 04 2018

nonn

Row 6 of A302265.

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

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

Cf. A302265.

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A302260 Number of n X 3 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A302267 Number of 3 X n 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

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