A263224 -id:A263224 - cp's OEIS frontend

A263218 Number of (n+1)X(2+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.

2, 14, 72, 343, 1920, 11444, 68112, 405019, 2422502, 14527358, 87130296, 522558079, 3134839248, 18808467356, 112848487824, 677075548723, 4062417593558, 24374464952438, 146246626666296, 877478675492551, 5264869525163232

Offset: 1

R. H. Hardin, Oct 12 2015

nonn

Column 2 of A263224.

			Some solutions for n=4
..2..2..1....1..2..0....0..1..2....0..1..2....0..1..2....0..0..0....2..2..1
..1..0..1....2..2..1....1..2..0....1..2..0....1..0..1....1..2..0....1..0..1
..2..2..1....0..0..0....2..2..1....2..0..2....0..1..2....0..0..0....2..2..1
..1..0..1....0..1..2....1..0..1....0..0..0....1..0..1....2..2..1....2..0..2
..0..0..0....0..1..2....2..2..1....0..0..0....0..0..0....2..0..2....2..0..2

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

Cf. A263224.

Empirical: a(n) = 8*a(n-1) -16*a(n-2) +32*a(n-3) +35*a(n-4) -664*a(n-5) +1328*a(n-6) -2656*a(n-7) +3121*a(n-8) +6904*a(n-9) -13808*a(n-10) +27616*a(n-11) -40643*a(n-12) -6248*a(n-13) +12496*a(n-14) -24992*a(n-15) +37488*a(n-16)

A263219 Number of (n+1)X(3+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.

Original entry on oeis.org

4, 72, 1009, 12601, 198892, 3345984, 56362801, 951167305, 16140651460, 274301213400, 4662032059249, 79241699410777, 1347050532750556, 22899642182348976, 389291621638482865, 6617932860469046761

Offset: 1

R. H. Hardin, Oct 12 2015

nonn

Column 3 of A263224.

			Some solutions for n=4
..1..0..1..0....2..2..2..2....1..0..1..0....0..1..2..0....0..2..2..1
..0..0..1..2....0..0..1..2....2..0..0..1....2..1..0..2....2..0..0..1
..2..1..0..2....0..2..2..1....1..0..1..0....0..1..2..0....0..0..0..0
..0..2..0..2....2..0..2..0....2..0..0..1....2..1..0..2....2..2..2..2
..1..0..2..2....2..0..2..0....0..0..0..0....0..0..0..0....0..2..2..1

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

Cf. A263224.

Empirical: a(n) = 24*a(n-1) -119*a(n-2) +2261*a(n-4) -54264*a(n-5) +269059*a(n-6) -1067290*a(n-8) +25614960*a(n-9) -127007510*a(n-10) +160126570*a(n-12) -3843037680*a(n-13) +19055061830*a(n-14) -8388238565*a(n-16) +201317725560*a(n-17) -998200389235*a(n-18) +103391555281*a(n-20) -2481397326744*a(n-21) +12303595078439*a(n-22) -95162378256*a(n-24) +2283897078144*a(n-25) -11324323012464*a(n-26)

A263220 Number of (n+1)X(4+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.

Original entry on oeis.org

7, 343, 12601, 475539, 22342751, 1094138875, 53375395657, 2607171566653, 127682197727311, 6256406902789159, 306545703110117209, 15020102223676251147, 735979598601461106119, 36062999023016301797227

Offset: 1

R. H. Hardin, Oct 12 2015

nonn

Column 4 of A263224.

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

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

Cf. A263224.

Empirical recurrence of order 89 (see link above)

A263221 Number of (n+1) X (5+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.

Original entry on oeis.org

13, 1920, 198892, 22342751, 3126162435, 456363243352, 66317081173996, 9651690803653879, 1408397535551222617, 205625917583136780312, 30019612862946349286716, 4382688566369987885721551

Offset: 1

R. H. Hardin, Oct 12 2015

nonn

Column 5 of A263224.

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

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

Cf. A263224.

A263222 Number of (n+1)X(6+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.

Original entry on oeis.org

26, 11444, 3345984, 1094138875, 456363243352, 199878687706434, 87072717791078712, 37998530090131229539, 16633155845877772714382, 7285320640434422479387484, 3190753333014806396532157872

Offset: 1

R. H. Hardin, Oct 12 2015

nonn

Column 6 of A263224.

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

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

Cf. A263224.

A263223 Number of (n+1)X(7+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.

Original entry on oeis.org

52, 68112, 56362801, 53375395657, 66317081173996, 87072717791078712, 113626071226676220337, 148577011002706188270265, 194947288514689323686605300, 255965788647405918475696491840

Offset: 1

R. H. Hardin, Oct 12 2015

nonn

Column 7 of A263224.

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

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

Cf. A263224.

A263217 Number of (n+1)X(n+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.

Original entry on oeis.org

1, 14, 1009, 475539, 3126162435, 199878687706434, 113626071226676220337, 582273491524766112505402255

Offset: 1

R. H. Hardin, Oct 12 2015

nonn

Diagonal of A263224.

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

Cf. A263224.

cp's OEIS Frontend

A263218 Number of (n+1)X(2+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A263219 Number of (n+1)X(3+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A263220 Number of (n+1)X(4+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A263221 Number of (n+1) X (5+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A263222 Number of (n+1)X(6+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A263223 Number of (n+1)X(7+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A263217 Number of (n+1)X(n+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.

Views

Author

Keywords

Comments

Examples

Crossrefs