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.

A277769 Number of 4Xn 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 A277769 #4 Oct 29 2016 07:32:40
%S A277769 0,14,330,9741,275018,7824415,221983169,6298326387,178728649865,
%T A277769 5071423132367,143902812077769,4083281399156407,115864087742823865,
%U A277769 3287671351656190808,93288470977649320614,2647082885606708742103
%N A277769 Number of 4Xn 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 A277769 Row 4 of A277767.
%H A277769 R. H. Hardin, <a href="/A277769/b277769.txt">Table of n, a(n) for n = 1..210</a>
%H A277769 R. H. Hardin, <a href="/A277769/a277769.txt">Empirical recurrence of order 98</a>
%F A277769 Empirical recurrence of order 98 (see link above)
%e A277769 Some solutions for n=4
%e A277769 ..0..1..2..0. .0..1..2..0. .0..1..0..2. .0..1..2..0. .0..1..2..1
%e A277769 ..2..1..1..1. .2..1..1..1. .2..2..1..1. .2..0..1..1. .2..0..0..0
%e A277769 ..1..1..0..1. .2..0..2..1. .2..1..0..2. .1..2..2..1. .1..0..1..2
%e A277769 ..0..2..2..2. .1..2..1..0. .0..1..1..2. .0..2..0..0. .2..2..0..2
%Y A277769 Cf. A277767.
%K A277769 nonn
%O A277769 1,2
%A A277769 _R. H. Hardin_, Oct 29 2016