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.

A269649 Number of length-n 0..n arrays with no adjacent pair x,x+1 repeated.

Original entry on oeis.org

2, 9, 64, 621, 7686, 115902, 2061940, 42277329, 981592964, 25455321375, 729233710320, 22870710513322, 779384544768952, 28676004488510379, 1132947222095403840, 47837636065465105365, 2149808857973618974752
Offset: 1

Views

Author

R. H. Hardin, Mar 02 2016

Keywords

Comments

Diagonal of A269656.

Examples

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

Crossrefs

Cf. A269656.