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.

A268320 Number of length-(n+1) 0..n arrays with new values introduced in sequential order, and with new repeated values introduced in sequential order, both starting with zero.

Original entry on oeis.org

2, 4, 11, 33, 114, 435, 1829, 8377, 41504, 220958, 1256927, 7602273, 48676925, 328685063, 2332565079, 17344752142, 134774766541, 1091701884974, 9198355199792, 80459135884925, 729337831748484, 6840215461149149
Offset: 1

Views

Author

R. H. Hardin, Feb 01 2016

Keywords

Comments

Diagonal of A268327.

Examples

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

Crossrefs

Cf. A268327.