A217232 T(n,k)=Number of triangular nXnXn arrays of occupancy after each element moves to some neighbor but without 2-loops and with no occupancy greater than k.

0, 0, 1, 0, 1, 1, 0, 1, 26, 1, 0, 1, 47, 1755, 1, 0, 1, 47, 4830, 321848, 1, 0, 1, 47, 5167, 1686393, 178829423, 1, 0, 1, 47, 5227, 1950380, 2096316167

Offset

1,9

Comments

Table starts

.0.........0..........0.......0....0..0.0.0

.1.........1..........1.......1....1..1.1

.1........26.........47......47...47.47

.1......1755.......4830....5167.5227

.1....321848....1686393.1950380

.1.178829423.2096316167

Links

Table of n, a(n) for n=1..34.

Example

Some solutions for n=4 k=3
.....0........0........0........0........1........0........1........1
....0.2......2.0......0.2......3.2......0.2......2.0......1.2......2.0
...3.2.1....0.2.1....1.1.3....2.1.1....1.2.0....1.3.2....0.1.0....2.3.0
..0.0.2.0..1.1.3.0..0.1.2.0..0.0.0.1..1.2.1.0..0.1.1.0..1.2.2.0..0.1.1.0

Crossrefs

Sequence in context: A023924 A022066 A291551 * A040681 A040682 A040683

Adjacent sequences: A217229 A217230 A217231 * A217233 A217234 A217235

Keyword

nonn,tabl,hard,more

Author

R. H. Hardin Sep 28 2012

Status

approved