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.

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

Original entry on oeis.org

2, 9, 60, 565, 6834, 101192, 1773384, 35904789, 824720230, 21189902503, 602161461276, 18752026405918, 635032992414506, 23234614293228525, 913376056016994576, 38392537083966394681, 1718296926207889973454
Offset: 1

Views

Author

R. H. Hardin, Feb 16 2016

Keywords

Comments

Diagonal of A268944.

Examples

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

Crossrefs

Cf. A268944.