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.

A222555 T(n,k)=Number of length (n+k)X1 arrays of occupancy after each element moves up to +-k places but not 0.

Original entry on oeis.org

1, 7, 2, 31, 20, 4, 121, 102, 64, 8, 456, 427, 359, 208, 16, 1709, 1668, 1562, 1279, 651, 32, 6427, 6372, 6220, 5761, 4537, 2056, 64, 24301, 24230, 24024, 23341, 21239, 15929, 6496, 128, 92368, 92279, 92011, 91052, 87752, 78245, 56041, 20483, 256, 352705
Offset: 1

Views

Author

R. H. Hardin Feb 24 2013

Keywords

Comments

Table starts
...1.....7.....31....121....456...1709...6427..24301..92368.352705
...2....20....102....427...1668...6372..24230..92279.352596
...4....64....359...1562...6220..24024..92011.352258
...8...208...1279...5761..23341..91052.350967
..16...651...4537..21239..87752.346091
..32..2056..15929..78245.330274
..64..6496..56041.287858
.128.20483.197313
.256.64627
.512

Examples

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

Crossrefs

Column 1 is A000079(n-1)
Row 1 is A048775