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.

A302279 Number of 2 X n 0..1 arrays with every element equal to 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

This page as a plain text file.
%I A302279 #7 Apr 05 2018 04:09:15
%S A302279 0,3,7,10,27,45,98,193,379,778,1523,3085,6138,12281,24603,49106,98363,
%T A302279 196557,393234,786481,1572731,3145946,6291203,12583117,25165802,
%U A302279 50331369,100663963,201325602,402654283,805305613,1610612610,3221227041
%N A302279 Number of 2 X n 0..1 arrays with every element equal to 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
%C A302279 Row 2 of A302278.
%H A302279 R. H. Hardin, <a href="/A302279/b302279.txt">Table of n, a(n) for n = 1..210</a>
%F A302279 Empirical: a(n) = a(n-1) + 3*a(n-2) - 4*a(n-4) for n > 5.
%e A302279 Some solutions for n=5:
%e A302279   0 1 1 0 0     0 0 1 0 0     0 0 1 0 0     0 1 1 0 0
%e A302279   1 0 0 1 1     0 1 1 0 0     0 1 1 1 0     0 0 1 1 0
%Y A302279 Cf. A302278.
%K A302279 nonn
%O A302279 1,2
%A A302279 _R. H. Hardin_, Apr 04 2018