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.

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

Original entry on oeis.org

2, 2, 4, 4, 6, 8, 6, 18, 16, 16, 10, 42, 74, 42, 32, 16, 108, 260, 308, 110, 64, 26, 268, 1046, 1664, 1282, 288, 128, 42, 676, 3974, 10246, 10566, 5338, 754, 256, 68, 1694, 15578, 60804, 99934, 66978, 22228, 1974, 512, 110, 4258, 60242, 368220, 925904, 975296
Offset: 1

Views

Author

R. H. Hardin Oct 19 2012

Keywords

Comments

Table starts
....2.....2........4..........6...........10..............16................26
....4.....6.......18.........42..........108.............268...............676
....8....16.......74........260.........1046............3974.............15578
...16....42......308.......1664........10246...........60804............368220
...32...110.....1282......10566........99934..........925904...........8679594
...64...288.....5338......66978.......975296........14096488.........204211050
..128...754....22228.....424332......9519284.......214514380........4803404048
..256..1974....92562....2687866.....92918894......3263893360......112984025006
..512..5168...385450...17025060....907013406.....49658510202.....2657601417086
.1024.13530..1605108..107835994...8853740672....755518606946....62512388662498
.2048.35422..6684066..683025864..86425318934..11494629017172..1470427119098160
.4096.92736.27834106.4326234664.843636853718.174881679122376.34587669928567490

Examples

			Some solutions for n=3, k=4
..1..0..0..0....0..0..1..0....1..1..1..1....0..0..0..0....1..0..0..0
..1..0..1..0....0..0..0..0....1..1..0..0....1..1..0..0....0..0..0..0
..0..0..0..0....1..0..0..1....1..0..0..0....0..0..0..0....1..1..0..1
		

Crossrefs

Column 2 is A025169(n-1).
Row 1 is A006355(n+1).