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.

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

This page as a plain text file.
%I A200667 #7 Jun 02 2025 07:19:28
%S A200667 8,36,164,750,3414,15504,70412,319532,1449895,6578528,29850070,
%T A200667 135443522,614568094,2788573700,12653014693,57412388798,260505742646,
%U A200667 1182031264628,5363405068469,24336170423291,110424101519685,501043586283665
%N A200667 Number of 0..7 arrays x(0..n-1) of n elements with each no smaller than the sum of its three previous neighbors modulo 8.
%C A200667 Column 7 of A200668
%H A200667 R. H. Hardin, <a href="/A200667/b200667.txt">Table of n, a(n) for n = 1..210</a>
%e A200667 Some solutions for n=6
%e A200667 ..4....4....2....5....3....0....1....1....4....4....0....0....0....6....0....0
%e A200667 ..6....4....6....7....7....0....7....3....5....5....4....5....3....7....4....0
%e A200667 ..6....3....0....4....6....1....7....5....2....5....5....5....6....5....4....3
%e A200667 ..4....4....6....5....3....1....7....4....4....6....7....6....1....4....1....7
%e A200667 ..2....5....6....0....7....4....6....7....3....0....6....2....6....0....4....4
%e A200667 ..5....5....5....1....4....6....7....5....5....7....6....7....6....7....2....6
%K A200667 nonn
%O A200667 1,1
%A A200667 _R. H. Hardin_ Nov 20 2011