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-10 of 11 results. Next

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

Original entry on oeis.org

1, 15, 76, 475, 2771, 16451, 97160, 574671, 3397622, 20089993, 118787443, 702368950, 4152971123, 24555730380, 145193342488, 858500551625, 5076149984859, 30014306641852, 177468870003729, 1049339576968817
Offset: 1

Views

Author

R. H. Hardin, Apr 06 2018

Keywords

Comments

Column 3 of A302381.

Examples

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

Crossrefs

Cf. A302381.

Formula

Empirical: a(n) = 4*a(n-1) +13*a(n-2) -5*a(n-3) -28*a(n-4) -11*a(n-5) +11*a(n-6) +4*a(n-7) +6*a(n-8) +24*a(n-9) +16*a(n-10) -32*a(n-11)

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

Original entry on oeis.org

2, 46, 430, 4640, 48980, 514655, 5421003, 57068484, 600825641, 6325616349, 66596986535, 701143904697, 7381754599676, 77716287676023, 818209464051271, 8614239598434833, 90692087070581459, 954820743332757828
Offset: 1

Views

Author

R. H. Hardin, Apr 06 2018

Keywords

Comments

Column 4 of A302381.

Examples

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

Crossrefs

Cf. A302381.

Formula

Empirical: a(n) = 8*a(n-1) +33*a(n-2) -25*a(n-3) -427*a(n-4) -361*a(n-5) +1618*a(n-6) +3070*a(n-7) -2572*a(n-8) -6300*a(n-9) +3216*a(n-10) +3053*a(n-11) -8191*a(n-12) +955*a(n-13) +12197*a(n-14) -2105*a(n-15) +634*a(n-16) -1833*a(n-17) -1727*a(n-18) -2285*a(n-19) +2346*a(n-20) -1596*a(n-21) +780*a(n-22) -134*a(n-23) -6*a(n-24) +44*a(n-25) -16*a(n-26)

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

Original entry on oeis.org

3, 161, 2886, 56541, 1089035, 20993054, 404225195, 7787623959, 150008013842, 2889619130491, 55662670608009, 1072229459666190, 20654344779041771, 397864432000232871, 7664058367627889686, 147632676645411073113
Offset: 1

Views

Author

R. H. Hardin, Apr 06 2018

Keywords

Comments

Column 5 of A302381.

Examples

			Some solutions for n=5
..0..0..0..1..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..1. .1..0..1..1..0. .1..0..0..1..1
..0..0..1..1..0. .1..1..1..0..1. .0..1..0..1..1. .1..1..0..0..1
..1..0..1..1..1. .1..0..0..1..1. .1..1..0..0..1. .1..1..1..1..0
..1..1..0..1..1. .0..0..0..0..0. .1..1..1..1..0. .0..0..1..0..0
		

Crossrefs

Cf. A302381.

Formula

Empirical recurrence of order 84 (see link above)

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

Original entry on oeis.org

5, 601, 19215, 688999, 24209608, 849467774, 29810775827, 1046322460741, 36721875744312, 1288827132390554, 45233709428352478, 1587559744275242497, 55718309872991118443, 1955535868305591162950, 68633103774355479650841
Offset: 1

Views

Author

R. H. Hardin, Apr 06 2018

Keywords

Comments

Column 6 of A302381.

Examples

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

Crossrefs

Cf. A302381.

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

Original entry on oeis.org

8, 2208, 127535, 8334338, 535192095, 34271733937, 2195619257236, 140685735128595, 9013655138528774, 577518643711241385, 37002236612561808562, 2370775298902153257752, 151898260084738496346512
Offset: 1

Views

Author

R. H. Hardin, Apr 06 2018

Keywords

Comments

Column 7 of A302381.

Examples

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

Crossrefs

Cf. A302381.

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

Original entry on oeis.org

0, 11, 76, 430, 2886, 19215, 127535, 847604, 5631313, 37416247, 248600404, 1651756796, 10974620983, 72917744789, 484481101148, 3218996316583, 21387701319096, 142104471542165, 944172564092345, 6273284870138765
Offset: 1

Views

Author

R. H. Hardin, Apr 06 2018

Keywords

Comments

Row 3 of A302381.

Examples

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

Crossrefs

Cf. A302381.

Formula

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

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

Original entry on oeis.org

0, 34, 475, 4640, 56541, 688999, 8334338, 100913905, 1222239033, 14803542454, 179291982859, 2171499466232, 26300156362525, 318534929264743, 3857942140993326, 46725546245979040, 565917413571325189
Offset: 1

Views

Author

R. H. Hardin, Apr 06 2018

Keywords

Comments

Row 4 of A302381.

Examples

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

Crossrefs

Cf. A302381.

Formula

Empirical: a(n) = 7*a(n-1) +54*a(n-2) +84*a(n-3) +189*a(n-4) -346*a(n-5) -2353*a(n-6) -2331*a(n-7) -6761*a(n-8) -16996*a(n-9) -27532*a(n-10) -27887*a(n-11) -32208*a(n-12) -69423*a(n-13) +95849*a(n-14) -78017*a(n-15) +96046*a(n-16) +178129*a(n-17) -220388*a(n-18) +739594*a(n-19) -344706*a(n-20) +304213*a(n-21) +725099*a(n-22) -969680*a(n-23) +586777*a(n-24) -644301*a(n-25) -302444*a(n-26) +761784*a(n-27) -159825*a(n-28) +115661*a(n-29) -48119*a(n-30) -118870*a(n-31) +70352*a(n-32) +21347*a(n-33) -3527*a(n-34) +9495*a(n-35) +1159*a(n-36) -4509*a(n-37) +1182*a(n-38) +139*a(n-39) -373*a(n-40) -43*a(n-41) +24*a(n-42) for n>43

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

Original entry on oeis.org

0, 111, 2771, 48980, 1089035, 24209608, 535192095, 11837195381, 261930946428, 5795956434998, 128249104063760, 2837819642235388, 62793689084100491, 1389463440460469952, 30745265560214208511, 680313952713083139457
Offset: 1

Views

Author

R. H. Hardin, Apr 06 2018

Keywords

Comments

Row 5 of A302381.

Examples

			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
..1..0..1..1..0. .0..0..1..1..0. .0..0..1..0..0. .0..0..1..1..0
..1..1..0..0..0. .0..1..1..0..1. .1..1..1..1..0. .0..1..1..1..1
..0..1..1..1..1. .0..1..1..0..0. .1..0..0..0..1. .0..1..1..0..0
..0..0..1..0..0. .1..0..0..1..0. .0..1..0..1..1. .1..0..0..1..1
		

Crossrefs

Cf. A302381.

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

Original entry on oeis.org

0, 361, 16451, 514655, 20993054, 849467774, 34271733937, 1383359844850, 55869034107773, 2256277862917399, 91119808168300632, 3679882775189443109, 148612776964178660961, 6001755395115442008533, 242382043501326104374522
Offset: 1

Views

Author

R. H. Hardin, Apr 06 2018

Keywords

Comments

Row 6 of A302381.

Examples

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

Crossrefs

Cf. A302381.

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

Original entry on oeis.org

0, 1172, 97160, 5421003, 404225195, 29810775827, 2195619257236, 161767569162389, 11926561967149057, 879261959837334277, 64822173992483793756, 4778918571861830147396, 352319630303338775663571
Offset: 1

Views

Author

R. H. Hardin, Apr 06 2018

Keywords

Comments

Row 7 of A302381.

Examples

			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..0..0..1..0. .0..0..0..1..0. .0..0..0..1..0. .0..0..0..1..0
..1..0..1..1..1. .1..0..1..1..0. .1..0..1..1..0. .1..0..1..1..0
..0..1..1..0..1. .1..1..0..0..1. .0..1..1..0..0. .0..1..0..0..1
..1..0..0..0..1. .0..0..1..0..1. .0..1..1..1..0. .1..0..0..0..0
..0..0..1..1..0. .0..0..1..1..0. .1..0..0..1..0. .0..1..1..0..0
..0..0..1..0..1. .0..1..0..0..1. .0..0..0..0..1. .0..0..0..1..1
		

Crossrefs

Cf. A302381.
Showing 1-10 of 11 results. Next