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.

A209739 Number of n X 3 0..5 arrays with every 2 X 2 subblock containing exactly one value repeat, and new values 0..5 introduced in row major order.

This page as a plain text file.
%I A209739 #7 Sep 07 2022 11:35:21
%S A209739 5,57,2025,103373,6262064,404495219,26715084257,1777603386801,
%T A209739 118573281463225,7915782848604211,528589085007311295,
%U A209739 35300530985616790273,2357529150039721810029,157447991892723989479547
%N A209739 Number of n X 3 0..5 arrays with every 2 X 2 subblock containing exactly one value repeat, and new values 0..5 introduced in row major order.
%C A209739 Column 3 of A209744.
%H A209739 R. H. Hardin, <a href="/A209739/b209739.txt">Table of n, a(n) for n = 1..210</a>
%F A209739 Empirical: a(n) = 100*a(n-1) -2365*a(n-2) +6020*a(n-3) +291532*a(n-4) -2681320*a(n-5) +4701820*a(n-6) +23602304*a(n-7) -82586672*a(n-8) +27026368*a(n-9) +113762816*a(n-10) -78159872*a(n-11) +7864320*a(n-12) for n>13.
%e A209739 Some solutions for n=5
%e A209739 ..0..0..0....0..0..0....0..0..0....0..0..0....0..0..0....0..0..0....0..0..0
%e A209739 ..1..2..1....1..2..3....1..2..1....1..2..1....1..2..1....1..2..1....1..2..1
%e A209739 ..0..0..0....3..1..1....1..0..0....0..0..1....3..3..1....2..0..0....3..3..2
%e A209739 ..1..3..4....4..3..0....1..2..3....1..2..1....0..1..2....0..3..4....2..4..2
%e A209739 ..1..5..3....5..3..1....0..0..3....0..0..0....0..3..1....0..5..4....0..0..2
%Y A209739 Cf. A209744.
%K A209739 nonn
%O A209739 1,1
%A A209739 _R. H. Hardin_ Mar 12 2012