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.

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

This page as a plain text file.
%I A200465 #7 Jun 02 2025 07:18:26
%S A200465 5,15,45,135,405,1213,3627,10846,32429,96970,289870,866499,2590128,
%T A200465 7742621,23144448,69183744,206804024,618180094,1847865864,5523643627,
%U A200465 16511274210,49355507149,147533484214,441007079909,1318258258809
%N A200465 Number of 0..4 arrays x(0..n-1) of n elements with each no smaller than the sum of its four previous neighbors modulo 5.
%C A200465 Column 4 of A200469
%H A200465 R. H. Hardin, <a href="/A200465/b200465.txt">Table of n, a(n) for n = 1..210</a>
%e A200465 Some solutions for n=6
%e A200465 ..2....2....3....0....2....0....0....1....0....1....0....0....2....1....0....3
%e A200465 ..3....4....3....2....3....0....1....4....2....4....0....1....2....1....3....4
%e A200465 ..1....1....4....4....3....3....3....1....3....0....1....4....4....4....3....4
%e A200465 ..1....4....2....1....3....4....4....4....4....2....4....2....4....4....1....1
%e A200465 ..2....1....2....3....1....4....4....3....4....4....1....3....2....2....3....2
%e A200465 ..3....0....3....2....0....3....2....3....4....4....2....1....3....1....4....4
%K A200465 nonn
%O A200465 1,1
%A A200465 _R. H. Hardin_ Nov 18 2011