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.

A240413 Number of 2Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.

This page as a plain text file.
%I A240413 #6 Jun 02 2025 09:56:02
%S A240413 5,10,32,80,162,493,1109,2656,7235,16492,41839,106203,251488,640167,
%T A240413 1579481,3845121,9681356,23735901,58568055,145990039,358605440,
%U A240413 888720845,2202562818,5427876319,13455220186,33269176662,82172839773,203518046217
%N A240413 Number of 2Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.
%C A240413 Row 2 of A240412
%H A240413 R. H. Hardin, <a href="/A240413/b240413.txt">Table of n, a(n) for n = 1..210</a>
%F A240413 Empirical: a(n) = 3*a(n-2) +10*a(n-3) -3*a(n-4) -6*a(n-5) -3*a(n-6) +8*a(n-7) -7*a(n-8) -9*a(n-9) -4*a(n-10) +13*a(n-11) -14*a(n-12) +17*a(n-13) -a(n-15) for n>16
%e A240413 Some solutions for n=4
%e A240413 ..3..2..3..3....2..3..3..2....3..2..3..2....3..2..2..2....2..3..3..3
%e A240413 ..1..0..3..1....2..1..2..0....3..0..1..2....3..0..0..0....2..1..1..2
%K A240413 nonn
%O A240413 1,1
%A A240413 _R. H. Hardin_, Apr 04 2014