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

A221449 Hilltop maps: number of 4Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..1 4Xn array.

Original entry on oeis.org

1, 105, 1473, 18393, 260557, 3669101, 51186449, 715191073, 9997750841, 139736151537, 1953034926537, 27297122633073, 381525299372673, 5332483219348113, 74530789226270781, 1041698296419651789
Offset: 1

Views

Author

R. H. Hardin Jan 17 2013

Keywords

Comments

Row 4 of A221446

Examples

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

Formula

Empirical: a(n) = 9*a(n-1) +33*a(n-2) +415*a(n-3) +1016*a(n-4) +4212*a(n-5) +4364*a(n-6) +6084*a(n-7) -16154*a(n-8) -52326*a(n-9) -58320*a(n-10) -23560*a(n-11) +258118*a(n-12) +206162*a(n-13) -324408*a(n-14) -244116*a(n-15) +148795*a(n-16) +166349*a(n-17) -20171*a(n-18) -24653*a(n-19) -40309*a(n-20) +12497*a(n-21) -8027*a(n-22) +28179*a(n-23) -16900*a(n-24) -1964*a(n-25) -8214*a(n-26) +1038*a(n-27) -2120*a(n-28) +2536*a(n-29) +134*a(n-30) +830*a(n-31) +228*a(n-32) +188*a(n-33) +16*a(n-34) +40*a(n-35) -a(n-36) +a(n-37) +a(n-38) -a(n-39)

A221450 Hilltop maps: number of 5Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..1 5Xn array.

Original entry on oeis.org

1, 355, 9829, 230845, 6415089, 177320895, 4832005625, 131942833529, 3606055280657, 98529266203659, 2692051448713949, 73554857285973785, 2009736562063323785, 54911874439751493035, 1500353181134236949205
Offset: 1

Views

Author

R. H. Hardin Jan 17 2013

Keywords

Comments

Row 5 of A221446

Examples

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

A221451 Hilltop maps: number of 6Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..1 6Xn array.

Original entry on oeis.org

1, 1201, 65569, 2897357, 157933741, 8569227073, 456064257841, 24333809830873, 1300168164767193, 69442977248777937, 3708745793506329473, 198080464024573391557, 10579291552464655635125, 565028486364173641870457
Offset: 1

Views

Author

R. H. Hardin Jan 17 2013

Keywords

Comments

Row 6 of A221446

Examples

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

A221452 Hilltop maps: number of 7Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..1 7Xn array.

Original entry on oeis.org

1, 4063, 437437, 36364977, 3888200065, 414116287743, 43045366565233, 4487793927664209, 468786655087266657, 48944887790539796639, 5109638176609475597301, 533452901877309087321537
Offset: 1

Views

Author

R. H. Hardin Jan 17 2013

Keywords

Comments

Row 7 of A221446

Examples

			Some solutions for n=3
..0..1..1....0..1..0....0..1..1....0..1..0....0..1..0....0..1..0....0..1..1
..0..0..0....0..1..0....0..0..1....0..0..1....1..1..1....1..1..1....0..1..0
..0..1..0....0..0..1....1..0..1....1..1..1....0..1..1....1..1..1....0..0..1
..1..0..1....1..1..1....0..1..1....0..0..1....1..0..0....0..0..1....1..0..0
..0..1..1....1..1..1....0..1..1....0..1..1....0..1..0....1..0..0....1..1..1
..0..1..0....1..0..1....0..1..1....0..1..0....1..0..1....0..1..1....0..0..1
..1..1..0....1..0..1....0..1..1....1..1..1....0..1..1....1..0..1....1..0..1
		
Previous Showing 11-14 of 14 results.