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.

A217982 T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random 0..1 nXk array.

Original entry on oeis.org

2, 2, 2, 4, 2, 4, 6, 4, 4, 6, 10, 6, 16, 6, 10, 16, 10, 36, 36, 10, 16, 26, 16, 100, 98, 100, 16, 26, 42, 26, 256, 362, 362, 256, 26, 42, 68, 42, 676, 1180, 1942, 1180, 676, 42, 68, 110, 68, 1764, 4046, 8872, 8872, 4046, 1764, 68, 110, 178, 110, 4624, 13594, 43258, 54504
Offset: 1

Views

Author

R. H. Hardin Oct 16 2012

Keywords

Comments

Table starts
...2...2.....4.......6........10.........16...........26............42
...2...2.....4.......6........10.........16...........26............42
...4...4....16......36.......100........256..........676..........1764
...6...6....36......98.......362.......1180.........4046.........13594
..10..10...100.....362......1942.......8872........43258........205446
..16..16...256....1180......8872......54504.......363728.......2347480
..26..26...676....4046.....43258.....363728......3375350......30097566
..42..42..1764...13594....205446....2347480.....30097566.....368335390
..68..68..4624...46052....986288...15361400....272859916....4595712084
.110.110.12100..155494...4714274...99957900...2457033362...56890420330
.178.178.31684..525730..22573862..651962620..22187715406..706581935362
.288.288.82944.1776548.108013892.4248252712.200128757472.8763874097740

Examples

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

Crossrefs

Columns 1 and 2 are A006355(n+1)
Column 3 is A206981(n-1)