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.

A221321 T(n,k)=Number of nonnegative integer arrays of length n summing to n without equal adjacent values modulo k.

Original entry on oeis.org

1, 1, 0, 1, 0, 0, 1, 2, 3, 0, 1, 2, 6, 8, 0, 1, 2, 7, 8, 5, 0, 1, 2, 7, 14, 19, 0, 0, 1, 2, 7, 14, 28, 44, 28, 0, 1, 2, 7, 14, 30, 66, 84, 72, 0, 1, 2, 7, 14, 30, 76, 168, 212, 45, 0, 1, 2, 7, 14, 30, 76, 185, 378, 474, 0, 0, 1, 2, 7, 14, 30, 76, 188, 430, 866, 1008, 286, 0, 1, 2, 7, 14, 30, 76
Offset: 1

Views

Author

R. H. Hardin Jan 10 2013

Keywords

Comments

Table starts
.1...1....1.....1.....1.....1.....1.....1.....1.....1.....1.....1.....1.....1
.0...0....2.....2.....2.....2.....2.....2.....2.....2.....2.....2.....2.....2
.0...3....6.....7.....7.....7.....7.....7.....7.....7.....7.....7.....7.....7
.0...8....8....14....14....14....14....14....14....14....14....14....14....14
.0...5...19....28....30....30....30....30....30....30....30....30....30....30
.0...0...44....66....76....76....76....76....76....76....76....76....76....76
.0..28...84...168...185...188...188...188...188...188...188...188...188...188
.0..72..212...378...430...444...444...444...444...444...444...444...444...444
.0..45..474...866..1044..1071..1075..1075..1075..1075..1075..1075..1075..1075
.0...0.1008..2128..2544..2638..2656..2656..2656..2656..2656..2656..2656..2656
.0.286.2438..5065..6154..6460..6499..6504..6504..6504..6504..6504..6504..6504
.0.728.5436.12000.15002.15756.15904.15926.15926.15926.15926.15926.15926.15926

Examples

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

Crossrefs

Diagonal is A221235 for n>3