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.

Previous Showing 11-13 of 13 results.

A268975 Number of 5Xn 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once.

Original entry on oeis.org

243, 8448, 114048, 1504656, 18852912, 231730344, 2799406656, 33382885464, 393837138576, 4605236160408, 53449814746368, 616434849399384, 7070720929863408, 80721453100802904, 917737124914636128
Offset: 1

Views

Author

R. H. Hardin, Feb 16 2016

Keywords

Comments

Row 5 of A268971.

Examples

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

Links

Crossrefs

Cf. A268971.

Formula

Empirical: a(n) = 32*a(n-1) -384*a(n-2) +2200*a(n-3) -6494*a(n-4) +9016*a(n-5) -816*a(n-6) -14888*a(n-7) +18879*a(n-8) -5464*a(n-9) -7472*a(n-10) +8336*a(n-11) -3648*a(n-12) +768*a(n-13) -64*a(n-14) for n>18

A268976 Number of 6Xn 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once.

Original entry on oeis.org

729, 39936, 808704, 16061328, 305242992, 5712070032, 105294777120, 1919046772584, 34636116041280, 620025612531912, 11021514910554528, 194739838779510504, 3422967847878219552, 59892951348957375576
Offset: 1

Views

Author

R. H. Hardin, Feb 16 2016

Keywords

Comments

Row 6 of A268971.

Examples

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

Links

Crossrefs

Cf. A268971.

Formula

Empirical: a(n) = 60*a(n-1) -1466*a(n-2) +19056*a(n-3) -143515*a(n-4) +608478*a(n-5) -957350*a(n-6) -3924114*a(n-7) +27201539*a(n-8) -68079378*a(n-9) +46537423*a(n-10) +212613240*a(n-11) -785654632*a(n-12) +1389943104*a(n-13) -1544105168*a(n-14) +1125401088*a(n-15) -524553472*a(n-16) +142135296*a(n-17) -17040384*a(n-18) for n>26

A268977 Number of 7Xn 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once.

Original entry on oeis.org

2187, 184320, 5598720, 167226768, 4823705520, 137497776840, 3870355944960, 107884943899488, 2981278225929744, 81772049776604472, 2228316762081730176, 60378377050028640600, 1627890867639031100112, 43698886755490031302440
Offset: 1

Views

Author

R. H. Hardin, Feb 16 2016

Keywords

Comments

Row 7 of A268971.

Examples

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

Links

Crossrefs

Cf. A268971.

Formula

Empirical recurrence of order 54 (see link above)
Previous Showing 11-13 of 13 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.