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.

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

This page as a plain text file.
%I A200467 #10 Oct 02 2023 16:23:04
%S A200467 7,28,112,448,1792,7140,28434,113193,450812,1795581,7151892,28486092,
%T A200467 113459436,451907189,1799936702,7169108310,28554377148,113731374269,
%U A200467 452989138551,1804244048124,7186257254293,28622677050945,114003380196965
%N A200467 Number of 0..6 arrays x(0..n-1) of n elements with each no smaller than the sum of its four previous neighbors modulo 7.
%H A200467 R. H. Hardin, <a href="/A200467/b200467.txt">Table of n, a(n) for n = 1..210</a>
%e A200467 Some solutions for n=6:
%e A200467 ..2....1....1....5....3....4....0....0....4....5....0....3....3....1....4....4
%e A200467 ..6....2....6....5....4....6....1....3....4....6....4....4....5....1....5....4
%e A200467 ..1....4....3....5....5....4....1....5....2....5....6....0....6....2....5....6
%e A200467 ..3....2....5....1....6....6....2....1....5....5....5....1....2....5....2....1
%e A200467 ..5....6....1....3....6....6....5....3....3....4....1....4....2....2....4....1
%e A200467 ..4....0....3....1....6....3....3....5....0....6....4....2....5....4....2....6
%Y A200467 Column 6 of A200469.
%K A200467 nonn
%O A200467 1,1
%A A200467 _R. H. Hardin_, Nov 18 2011