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.

A303677 Number of nX2 0..1 arrays with every element unequal to 0, 1 or 3 king-move adjacent elements, with upper left element zero.

Original entry on oeis.org

2, 5, 7, 17, 31, 49, 103, 193, 327, 641, 1207, 2129, 4039, 7585, 13687, 25585, 47847, 87425, 162391, 302609, 556615, 1031329, 1916983, 3538225, 6550311, 12155585, 22474519, 41599313, 77121031, 142707937, 264156151, 489441649, 906031335
Offset: 1

Views

Author

R. H. Hardin, Apr 28 2018

Keywords

Comments

Column 2 of A303682.

Examples

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

Links

Crossrefs

Cf. A303682.

Formula

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

A303678 Number of nX4 0..1 arrays with every element unequal to 0, 1 or 3 king-move adjacent elements, with upper left element zero.

Original entry on oeis.org

5, 17, 15, 28, 44, 64, 90, 132, 204, 312, 466, 688, 1024, 1540, 2318, 3472, 5184, 7748, 11606, 17396, 26052, 38984, 58338, 87340, 130788, 195824, 293146, 438824, 656952, 983564, 1472534, 2204504, 3300280, 4940796, 7396894, 11073932, 16578716
Offset: 1

Views

Author

R. H. Hardin, Apr 28 2018

Keywords

Comments

Column 4 of A303682.

Examples

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

Links

Crossrefs

Cf. A303682.

Formula

Empirical: a(n) = a(n-1) +a(n-4) +a(n-5) for n>8

A303679 Number of nX5 0..1 arrays with every element unequal to 0, 1 or 3 king-move adjacent elements, with upper left element zero.

Original entry on oeis.org

8, 31, 25, 44, 76, 110, 150, 212, 306, 458, 684, 1006, 1462, 2132, 3122, 4586, 6732, 9870, 14454, 21172, 31026, 45482, 66668, 97710, 143190, 209844, 307538, 450730, 660588, 968142, 1418870, 2079444, 3047570, 4466442, 6545900, 9593486, 14059926
Offset: 1

Views

Author

R. H. Hardin, Apr 28 2018

Keywords

Comments

Column 5 of A303682.

Examples

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

Links

Crossrefs

Cf. A303682.

Formula

Empirical: a(n) = a(n-1) +a(n-4) +a(n-6) for n>10

A303680 Number of nX6 0..1 arrays with every element unequal to 0, 1 or 3 king-move adjacent elements, with upper left element zero.

Original entry on oeis.org

13, 49, 39, 64, 110, 177, 245, 335, 467, 657, 949, 1391, 2035, 2937, 4221, 6079, 8771, 12657, 18269, 26383, 38091, 54969, 79317, 114471, 165219, 238457, 344157, 496719, 716907, 1034681, 1493309, 2155247, 3110611, 4489449, 6479477, 9351631, 13496923
Offset: 1

Views

Author

R. H. Hardin, Apr 28 2018

Keywords

Comments

Column 6 of A303682.

Examples

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

Links

Crossrefs

Cf. A303682.

Formula

Empirical: a(n) = a(n-1) +a(n-4) +a(n-7) for n>12

A303681 Number of nX7 0..1 arrays with every element unequal to 0, 1 or 3 king-move adjacent elements, with upper left element zero.

Original entry on oeis.org

21, 103, 57, 90, 150, 245, 367, 509, 697, 957, 1311, 1851, 2671, 3869, 5547, 7907, 11275, 16101, 22959, 32717, 46663, 66633, 95139, 135763, 193701, 276435, 394533, 563013, 803377, 1146445, 1636117, 2334893, 3331971, 4754851, 6785501, 9683407
Offset: 1

Views

Author

R. H. Hardin, Apr 28 2018

Keywords

Comments

Column 7 of A303682.

Examples

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

Links

Crossrefs

Cf. A303682.

Formula

Empirical: a(n) = a(n-1) +a(n-4) +a(n-8) for n>14

A303676 Number of n X n 0..1 arrays with every element unequal to 0, 1 or 3 king-move adjacent elements, with upper left element zero.

Original entry on oeis.org

1, 5, 9, 28, 76, 177, 367, 774, 1684, 3639, 7597, 15617, 32101, 66074, 135096, 274104, 553668, 1116275, 2245277, 4501938, 9000074, 17953486, 35749382, 71056212, 140977366, 279246077, 552333115, 1091040731
Offset: 1

Views

Author

R. H. Hardin, Apr 28 2018

Keywords

Comments

Diagonal of A303682.

Examples

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

Crossrefs

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.