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.

A277762 Number of n X 3 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 A277762 #6 Jun 26 2022 04:42:57
%S A277762 0,4,17,330,3666,46289,560809,6883464,84161576,1030163755,12605295745,
%T A277762 154256946272,1887655962034,23099627259711,282674025688925,
%U A277762 3459132503499606,42330011144976582,517999809756567289
%N A277762 Number of n X 3 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 A277762 Column 3 of A277767.
%H A277762 R. H. Hardin, <a href="/A277762/b277762.txt">Table of n, a(n) for n = 1..210</a>
%F A277762 Empirical: a(n) = 11*a(n-1) +15*a(n-2) -6*a(n-3) +164*a(n-4) -947*a(n-5) +1147*a(n-6) +106*a(n-7) -215*a(n-8) -374*a(n-9) -134*a(n-10) +168*a(n-11).
%e A277762 Some solutions for n=4
%e A277762 ..0..1..2. .0..1..2. .0..1..0. .0..1..2. .0..1..2. .0..1..2. .0..1..2
%e A277762 ..2..1..0. .2..1..0. .2..2..2. .2..1..0. .2..1..0. .2..2..0. .2..0..0
%e A277762 ..1..0..1. .1..2..1. .2..1..0. .0..2..0. .1..2..1. .1..0..0. .1..0..1
%e A277762 ..2..2..2. .0..2..0. .0..2..2. .1..1..0. .0..0..2. .2..2..1. .1..2..2
%Y A277762 Cf. A277767.
%K A277762 nonn
%O A277762 1,2
%A A277762 _R. H. Hardin_, Oct 29 2016