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.

A240407 Number of nX2 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of 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 A240407 #7 Jun 02 2025 09:55:20
%S A240407 2,10,33,139,529,2105,8258,32480,127944,503372,1982058,7801697,
%T A240407 30716039,120917541,476048890,1874110143,7378197850,29046994153,
%U A240407 114354774523,450201581068,1772392670851,6977710726893,27470462435959,108148134784975
%N A240407 Number of nX2 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.
%C A240407 Column 2 of A240412
%H A240407 R. H. Hardin, <a href="/A240407/b240407.txt">Table of n, a(n) for n = 1..210</a>
%F A240407 Empirical: a(n) = 2*a(n-1) +11*a(n-2) -a(n-3) -39*a(n-4) -40*a(n-5) +3*a(n-6) +13*a(n-7) +64*a(n-8) +162*a(n-9) -220*a(n-10) +122*a(n-11) -38*a(n-12) -82*a(n-13) +60*a(n-14)
%e A240407 Some solutions for n=4
%e A240407 ..2..3....2..3....2..3....3..2....3..2....2..3....3..2....3..2....2..3....3..2
%e A240407 ..2..3....2..3....2..3....3..0....1..0....2..3....1..0....2..1....1..3....3..1
%e A240407 ..2..0....3..1....3..1....1..0....2..0....3..0....3..0....3..1....3..2....1..2
%e A240407 ..2..1....1..2....3..1....1..2....2..0....2..1....1..0....3..0....2..0....1..0
%K A240407 nonn
%O A240407 1,1
%A A240407 _R. H. Hardin_, Apr 04 2014