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.

Showing 1-6 of 6 results.

A299446 Number of n X 3 0..1 arrays with every element equal to 0, 1, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.

Original entry on oeis.org

3, 4, 1, 4, 10, 6, 11, 41, 24, 42, 169, 100, 159, 710, 405, 643, 2995, 1673, 2659, 12648, 6948, 11132, 53434, 29109, 46870, 225916, 122510, 197807, 955669, 517066, 835904, 4044687, 2185734, 3535227, 17123968, 9247255, 14959235, 72513441, 39141547
Offset: 1

Views

Author

R. H. Hardin, Feb 10 2018

Keywords

Comments

Column 3 of A299451.

Examples

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

Crossrefs

Cf. A299451.

Formula

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

A299447 Number of nX4 0..1 arrays with every element equal to 0, 1, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.

Original entry on oeis.org

5, 8, 4, 21, 32, 36, 161, 264, 430, 1475, 2598, 4872, 14489, 27382, 55350, 152073, 300506, 637120, 1666139, 3393668, 7453726, 18821937, 39280750, 88534484, 217732841, 464385964, 1065353486, 2568691553, 5587193344, 12959951420
Offset: 1

Views

Author

R. H. Hardin, Feb 10 2018

Keywords

Comments

Column 4 of A299451.

Examples

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

Crossrefs

Cf. A299451.

Formula

Empirical: a(n) = 2*a(n-1) +28*a(n-3) -52*a(n-4) +8*a(n-5) -340*a(n-6) +540*a(n-7) -163*a(n-8) +2342*a(n-9) -2972*a(n-10) +1447*a(n-11) -9888*a(n-12) +9735*a(n-13) -7214*a(n-14) +25815*a(n-15) -21158*a(n-16) +21484*a(n-17) -40314*a(n-18) +35462*a(n-19) -36851*a(n-20) +34259*a(n-21) -49384*a(n-22) +31446*a(n-23) -8240*a(n-24) +50699*a(n-25) -3360*a(n-26) -17526*a(n-27) -37273*a(n-28) -19284*a(n-29) +23240*a(n-30) +25447*a(n-31) +17703*a(n-32) -12731*a(n-33) -18486*a(n-34) -10144*a(n-35) +4751*a(n-36) +5296*a(n-37) +5272*a(n-38) -3166*a(n-39) +3531*a(n-40) +4251*a(n-41) +4861*a(n-42) +468*a(n-43) -5642*a(n-44) -5798*a(n-45) -3385*a(n-46) +241*a(n-47) +3045*a(n-48) +2352*a(n-49) +1058*a(n-50) -51*a(n-51) -900*a(n-52) -327*a(n-53) -301*a(n-54) +29*a(n-55) +79*a(n-56) +12*a(n-57) +47*a(n-58) -2*a(n-59) +3*a(n-60) +2*a(n-61) -2*a(n-62) for n>63

A299448 Number of n X 5 0..1 arrays with every element equal to 0, 1, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.

Original entry on oeis.org

8, 32, 10, 32, 231, 163, 546, 2904, 2321, 8729, 37095, 34873, 133308, 479406, 532460, 2010313, 6292009, 8198893, 30089392, 84206120, 126909538, 448256806, 1150937204, 1973045921, 6665452062, 16078638245, 30784208565, 99193604275
Offset: 1

Views

Author

R. H. Hardin, Feb 10 2018

Keywords

Comments

Column 5 of A299451.

Examples

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

Crossrefs

Cf. A299451.

A299449 Number of nX6 0..1 arrays with every element equal to 0, 1, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.

Original entry on oeis.org

13, 32, 6, 36, 163, 211, 804, 3138, 4869, 21921, 69029, 124071, 546218, 1618499, 3376921, 13736175, 39336909, 93790311, 354629529, 1001089492, 2646208503, 9425431827, 26696252479, 75904957451, 258154313037, 742028632025
Offset: 1

Views

Author

R. H. Hardin, Feb 10 2018

Keywords

Comments

Column 6 of A299451.

Examples

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

Crossrefs

Cf. A299451.

A299450 Number of nX7 0..1 arrays with every element equal to 0, 1, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.

Original entry on oeis.org

21, 64, 11, 161, 546, 804, 6326, 19745, 39495, 290364, 855008, 2191987, 14241405, 41451856, 129702347, 739374632, 2206681686, 7939800765, 40476006538, 126433675843, 496773451920, 2321391370041, 7652725646418, 31537376314083
Offset: 1

Views

Author

R. H. Hardin, Feb 10 2018

Keywords

Comments

Column 7 of A299451.

Examples

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

Crossrefs

Cf. A299451.

A299445 Number of n X n 0..1 arrays with every element equal to 0, 1, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.

Original entry on oeis.org

1, 4, 1, 21, 231, 211, 6326, 174794, 665961, 84553473, 4512663317
Offset: 1

Views

Author

R. H. Hardin, Feb 10 2018

Keywords

Comments

Diagonal of A299451.

Examples

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

Crossrefs

Cf. A299451.
Showing 1-6 of 6 results.