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.

A277765 Number of nX6 0..2 arrays with every element equal to some element at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) or (1,0) both plus 1 mod 3 and minus 1 mod 3, with new values introduced in order 0..2.

This page as a plain text file.
%I A277765 #4 Oct 29 2016 07:28:56
%S A277765 0,356,21141,7824415,1487830718,343944986355,74591651561541,
%T A277765 16513537201433122,3631417278822015869,800314315609344769958,
%U A277765 176252542616326417994974,38825002002696841996583880
%N A277765 Number of nX6 0..2 arrays with every element equal to some element at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) or (1,0) both plus 1 mod 3 and minus 1 mod 3, with new values introduced in order 0..2.
%C A277765 Column 6 of A277767.
%H A277765 R. H. Hardin, <a href="/A277765/b277765.txt">Table of n, a(n) for n = 1..92</a>
%e A277765 Some solutions for n=3
%e A277765 ..0..1..2..0..1..2. .0..1..0..2..1..2. .0..1..2..0..1..2. .0..1..0..2..2..1
%e A277765 ..2..1..0..0..2..0. .2..2..1..0..0..0. .2..0..2..1..2..0. .2..2..2..1..0..0
%e A277765 ..0..0..2..2..1..1. .1..0..2..1..1..2. .2..1..1..2..0..1. .0..1..0..0..2..1
%Y A277765 Cf. A277767.
%K A277765 nonn
%O A277765 1,2
%A A277765 _R. H. Hardin_, Oct 29 2016