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.

A209460 Number of nX3 0..6 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..6 introduced in row major order.

This page as a plain text file.
%I A209460 #7 Jul 22 2025 21:44:04
%S A209460 5,57,2027,107472,7487423,613535578,54657856108,5063931781244,
%T A209460 477499692659113,45377744955417080,4327164788760402815,
%U A209460 413256848215007047168,39493493565836673722433,3775359326879189119846436
%N A209460 Number of nX3 0..6 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..6 introduced in row major order.
%C A209460 Column 3 of A209465
%H A209460 R. H. Hardin, <a href="/A209460/b209460.txt">Table of n, a(n) for n = 1..210</a>
%F A209460 Empirical: a(n) = 172*a(n-1) -8737*a(n-2) +125848*a(n-3) +1640003*a(n-4) -58941308*a(n-5) +441046249*a(n-6) +799433456*a(n-7) -23572369886*a(n-8) +84702514904*a(n-9) +67645214404*a(n-10) -904101250144*a(n-11) +1363565491464*a(n-12) +425476260576*a(n-13) -2084864162400*a(n-14) +1100743344000*a(n-15) -104976000000*a(n-16) for n>17
%e A209460 Some solutions for n=4
%e A209460 ..0..0..0....0..1..0....0..0..1....0..1..1....0..0..0....0..0..0....0..0..0
%e A209460 ..1..2..1....0..2..0....1..2..2....0..2..0....1..2..1....1..2..3....1..2..1
%e A209460 ..3..1..0....0..3..3....0..0..1....0..1..0....3..3..3....0..0..0....0..0..2
%e A209460 ..0..1..2....0..1..0....1..2..0....0..2..2....4..5..1....4..2..4....1..2..1
%K A209460 nonn
%O A209460 1,1
%A A209460 _R. H. Hardin_ Mar 09 2012