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.

A200666 Number of 0..6 arrays x(0..n-1) of n elements with each no smaller than the sum of its three previous neighbors modulo 7.

Original entry on oeis.org

7, 28, 112, 448, 1813, 7322, 29536, 119066, 479993, 1935168, 7802161, 31456852, 126827111, 511338342, 2061602939, 8311924900, 33511832745, 135112262286, 544742594039, 2196280995578, 8854916583356, 35701054472646, 143938712300001
Offset: 1

Views

Author

R. H. Hardin, Nov 20 2011

Keywords

Examples

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

Crossrefs

Column 6 of A200668.