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.

A221684 Number of 0..n arrays of length 5 with each element differing from at least one neighbor by 1 or less, starting with 0.

Original entry on oeis.org

16, 40, 68, 100, 133, 166, 199, 232, 265, 298, 331, 364, 397, 430, 463, 496, 529, 562, 595, 628, 661, 694, 727, 760, 793, 826, 859, 892, 925, 958, 991, 1024, 1057, 1090, 1123, 1156, 1189, 1222, 1255, 1288, 1321, 1354, 1387, 1420, 1453, 1486, 1519, 1552, 1585
Offset: 1

Views

Author

R. H. Hardin Jan 22 2013

Keywords

Comments

Row 5 of A221683

Examples

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

Formula

Empirical: a(n) = 33*n - 32 for n>3