login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 1

%I

%S 5,15,45,135,405,1213,3627,10846,32429,96970,289870,866499,2590128,

%T 7742621,23144448,69183744,206804024,618180094,1847865864,5523643627,

%U 16511274210,49355507149,147533484214,441007079909,1318258258809

%N 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 Column 4 of A200469

%H R. H. Hardin, <a href="/A200465/b200465.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=6

%e ..2....2....3....0....2....0....0....1....0....1....0....0....2....1....0....3

%e ..3....4....3....2....3....0....1....4....2....4....0....1....2....1....3....4

%e ..1....1....4....4....3....3....3....1....3....0....1....4....4....4....3....4

%e ..1....4....2....1....3....4....4....4....4....2....4....2....4....4....1....1

%e ..2....1....2....3....1....4....4....3....4....4....1....3....2....2....3....2

%e ..3....0....3....2....0....3....2....3....4....4....2....1....3....1....4....4

%K nonn

%O 1,1

%A _R. H. Hardin_ Nov 18 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 24 20:35 EDT 2021. Contains 348233 sequences. (Running on oeis4.)