A220997 -id:A220997 - cp's OEIS frontend

A221852 T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some horizontal, diagonal or antidiagonal neighbor, without consecutive moves in the same direction.

1, 3, 1, 6, 31, 1, 13, 302, 306, 1, 28, 3437, 10085, 2989, 1, 60, 37155, 465305, 354670, 29135, 1, 129, 406612, 19159028, 67228149, 12277568, 283872, 1, 277, 4434129, 811781250, 10799370973, 9607602488, 426752551, 2765627, 1, 595, 48397883

Offset: 1

R. H. Hardin Jan 27 2013

Table starts
.1.......3.........6.........13..........28............60.........129......277
.1......31.......302.......3437.......37155........406612.....4434129.48397883
.1.....306.....10085.....465305....19159028.....811781250.34109464173
.1....2989....354670...67228149.10799370973.1802820316744
.1...29135..12277568.9607602488
.1..283872.426752551
.1.2765627
.1

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

R. H. Hardin, Table of n, a(n) for n = 1..40

Column 2 is A220997

Row 1 is A002478

A221723 T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some horizontal, diagonal or antidiagonal neighbor.

Original entry on oeis.org

1, 3, 1, 8, 31, 1, 21, 318, 306, 1, 55, 3605, 11733, 2989, 1, 144, 39851, 544757, 429160, 29135, 1, 377, 441912, 24019048, 81980587, 15672482, 283872, 1, 987, 4896043, 1068474439, 14223656107, 12325049264, 572137641, 2765627, 1, 2584, 54248371

Offset: 1

R. H. Hardin Jan 22 2013

Table starts
.1........3...........8............21............55...........144
.1.......31.........318..........3605.........39851........441912
.1......306.......11733........544757......24019048....1068474439
.1.....2989......429160......81980587...14223656107.2507976517152
.1....29135....15672482...12325049264.8391238535304
.1...283872...572137641.1852447247829
.1..2765627.20884488408
.1.26943707
.1

			Some solutions for n=3 k=4
..0..3..1..0....0..1..1..2....0..1..2..0....0..2..1..0....0..1..1..0
..0..1..0..1....0..1..3..0....0..0..0..2....0..1..2..4....0..5..1..0
..1..2..2..1....3..0..1..0....3..1..3..0....0..1..0..1....1..1..2..0

R. H. Hardin, Table of n, a(n) for n = 1..49

Column 2 is A220997
Row 1 is A001906
Row 2 is A221189

cp's OEIS Frontend

A221852 T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some horizontal, diagonal or antidiagonal neighbor, without consecutive moves in the same direction.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs