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-8 of 8 results.

A183577 Half the number of nX2 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.

Original entry on oeis.org

2, 14, 78, 407, 2216, 12024, 65277, 354615, 1926386, 10465655, 56858572, 308906899, 1678265791, 9117888439, 49536803509, 269129777690, 1462162196206, 7943819360442, 43158185018445, 234475238671702, 1273886693818638
Offset: 1

Views

Author

R. H. Hardin Jan 05 2011

Keywords

Comments

Column 2 of A183584

Examples

			Some solutions with a(1,1)<=1 for 3X2
..0..0....1..3....1..1....0..2....0..0....1..1....1..0....0..0....1..1....0..0
..0..0....1..3....2..1....0..2....3..0....2..0....1..0....0..0....0..0....2..2
..0..0....1..1....2..2....0..2....3..0....2..0....1..0....1..1....2..2....0..0

Links

Formula

Empirical: a(n)=7*a(n-1)-8*a(n-2)+4*a(n-3)-41*a(n-4)+20*a(n-5)-13*a(n-6)+130*a(n-7)+32*a(n-8)+94*a(n-9)-118*a(n-10)-88*a(n-11)-93*a(n-12)-a(n-13)+20*a(n-14)

A183578 Half the number of n X 3 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.

Original entry on oeis.org

2, 78, 814, 9667, 110674, 1282814, 14823037, 171459557, 1982720806, 22929915669, 265174801858, 3066662593835, 35464903052433, 410139828611289, 4743130059530921, 54852719114258196, 634353415473617224
Offset: 1

Views

Author

R. H. Hardin, Jan 05 2011

Keywords

Comments

Column 3 of A183584.

Examples

			Some solutions with a(1,1)<=1 for 5 X 3
..0..0..0....1..0..0....0..0..2....1..0..0....0..0..3....0..1..1....1..0..1
..0..3..3....1..1..0....0..2..2....1..1..1....0..0..3....0..0..0....1..0..1
..1..0..0....0..0..2....2..1..2....3..0..0....3..3..3....2..2..0....1..0..0
..1..1..1....0..0..2....2..1..1....3..0..0....2..2..3....0..0..0....0..1..0
..0..0..1....0..1..1....1..1..1....3..0..0....2..2..2....0..1..1....0..1..0

Links

Crossrefs

Cf. A183584.

A183579 Half the number of nX4 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.

Original entry on oeis.org

8, 407, 9667, 240358, 5987795, 149355515, 3724940988, 92915045150, 2317648165893, 57811518197886, 1442053664104187, 35970710709296927, 897256757776720016, 22381259751777880373, 558280348730102033060
Offset: 1

Views

Author

R. H. Hardin Jan 05 2011

Keywords

Comments

Column 4 of A183584

Examples

			Some solutions with a(1,1)<=1 for 3X4
..0..0..2..1....1..1..1..1....1..1..1..1....1..3..1..1....0..0..1..1
..1..0..2..1....1..3..1..1....0..0..2..2....1..3..3..1....1..1..1..1
..1..0..2..2....1..3..3..1....0..0..0..2....2..2..3..3....1..0..0..1

Links

A183580 Half the number of nX5 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.

Original entry on oeis.org

14, 2216, 110674, 5987795, 320224986, 17195908538, 922710498351, 49526167251643, 2658141294593252, 142669482408162261, 7657427974138825496, 410994055177191194749, 22059119691987705997667, 1183970555622672309839445
Offset: 1

Views

Author

R. H. Hardin Jan 05 2011

Keywords

Comments

Column 5 of A183584

Examples

			Some solutions with a(1,1)<=1 for 3X5
..0..1..1..0..1....0..0..1..1..1....0..0..0..0..2....0..0..1..1..3
..0..0..0..0..1....0..1..0..0..1....0..0..0..3..2....2..0..1..1..3
..0..0..0..0..1....0..1..0..1..1....1..1..0..3..3....2..0..0..3..3

Links

A183581 Half the number of nX6 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.

Original entry on oeis.org

38, 12024, 1282814, 149355515, 17195908538, 1988200387149, 229716738097391, 26548571098836075, 3068082753691026342, 354569738678873849813, 40976532204608285387767, 4735538672860090875422373
Offset: 1

Views

Author

R. H. Hardin Jan 05 2011

Keywords

Comments

Column 6 of A183584

Examples

			Some solutions with a(1,1)<=1 for 3X6
..0..0..2..2..1..3....0..0..0..3..3..3....0..0..1..0..0..0....0..0..2..2..3..1
..0..1..1..1..1..3....0..2..0..3..3..2....0..1..1..1..0..0....0..0..0..3..3..1
..1..1..1..2..2..2....0..2..2..2..3..2....1..1..1..1..1..1....0..0..2..2..3..1

Links

A183576 Half the number of n X n 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.

Original entry on oeis.org

0, 14, 814, 240358, 320224986, 1988200387149, 57140106100076100
Offset: 1

Views

Author

R. H. Hardin Jan 05 2011

Keywords

Comments

Diagonal of A183584

Examples

			Some solutions with a(1,1)<=1 for 3X3
..0..3..3....0..0..3....1..1..3....1..1..0....1..3..0....1..2..2....1..1..1
..0..3..0....0..3..3....1..1..3....1..0..0....1..3..0....1..1..1....1..1..1
..0..3..0....0..0..3....3..3..3....1..0..0....1..3..0....3..3..3....1..2..2

A183582 Half the number of n X 7 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.

Original entry on oeis.org

80, 65277, 14823037, 3724940988, 922710498351, 229716738097391, 57140106100076100, 14217486118795912134
Offset: 1

Views

Author

R. H. Hardin, Jan 05 2011

Keywords

Examples

			Some solutions with a(1,1)<=1 for 3 X 7:
..0..0..0..2..2..0..0....0..0..0..1..1..0..0....0..0..0..2..2..0..0
..0..0..0..0..2..0..0....0..0..1..1..1..1..1....0..0..0..0..0..0..3
..0..1..1..1..1..3..3....0..0..0..2..2..1..1....0..1..1..0..3..3..3

Crossrefs

Column 7 of A183584.

A183583 Half the number of nX8 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.

Original entry on oeis.org

194, 354615, 171459557, 92915045150, 49526167251643, 26548571098836075, 14217486118795912134
Offset: 1

Views

Author

R. H. Hardin Jan 05 2011

Keywords

Comments

Column 8 of A183584

Examples

			Some solutions with a(1,1)<=1 for 3X8
..0..0..0..0..1..1..0..0....0..0..0..3..3..0..0..0....0..0..0..0..0..0..3..3
..0..0..0..1..1..1..1..1....0..0..0..0..3..0..0..2....0..0..0..1..0..3..3..3
..0..0..0..1..1..0..0..1....0..0..0..0..3..0..0..2....0..0..0..1..1..1..1..1
Showing 1-8 of 8 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.