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.

A269770 Number of length-n 0..n arrays with every repeated value unequal to the previous repeated value plus one mod n+1.

Original entry on oeis.org

2, 9, 64, 620, 7680, 115920, 2063880, 42342912, 983566800, 25515160000, 731128554024, 22934195241984, 781644611944014, 28761550510694400, 1136386416816000000, 47984229920230342656, 2156419762355192954760
Offset: 1

Views

Author

R. H. Hardin, Mar 04 2016

Keywords

Comments

Diagonal of A269776.

Examples

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

Crossrefs

Cf. A269776.