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.

A269600 Number of length-n 0..n arrays with no repeated value differing from the previous repeated value by one or less.

Original entry on oeis.org

2, 9, 60, 572, 7030, 105892, 1886252, 38768412, 902743646, 23482784400, 674804472216, 21227322458468, 725465523386294, 26765145874993234, 1060182321437102136, 44874027105660248520, 2021234030434596074938
Offset: 1

Views

Author

R. H. Hardin, Mar 01 2016

Keywords

Comments

Diagonal of A269606.

Examples

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

Crossrefs

Cf. A269606.