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.

A268022 Number of nX3 0..2 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value.

This page as a plain text file.
%I A268022 #5 Jan 24 2016 14:07:45
%S A268022 27,729,13824,250047,4019679,61162984,876467493,12040481088,
%T A268022 159131975059,2037756289752,25373307641625,308367729216000,
%U A268022 3667582185888375,42790530532833000,490685528946353021,5539482984199419072
%N A268022 Number of nX3 0..2 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value.
%C A268022 Column 3 of A268026.
%H A268022 R. H. Hardin, <a href="/A268022/b268022.txt">Table of n, a(n) for n = 1..210</a>
%F A268022 Empirical: a(n) = 56*a(n-1) -1170*a(n-2) +8532*a(n-3) +59031*a(n-4) -1349748*a(n-5) +4015908*a(n-6) +64757664*a(n-7) -463647600*a(n-8) -1255566144*a(n-9) +19457594304*a(n-10) -3621049344*a(n-11) -467191259136*a(n-12) +700630695936*a(n-13) +7110421807104*a(n-14) -15956683259904*a(n-15) -70142096572416*a(n-16) +189870895005696*a(n-17) +438443477827584*a(n-18) -1332652586041344*a(n-19) -1652114199674880*a(n-20) +5489741298401280*a(n-21) +3651168878198784*a(n-22) -12532783289204736*a(n-23) -5719659487690752*a(n-24) +15199648742375424*a(n-25) +6966505673588736*a(n-26) -7881299347898368*a(n-27) -4503599627370496*a(n-28)
%e A268022 Some solutions for n=3
%e A268022 ..1..2..1....2..2..1....0..1..2....1..1..1....2..0..2....0..1..1....0..2..2
%e A268022 ..0..0..0....2..0..1....1..2..0....0..1..0....0..2..1....0..2..0....1..1..0
%e A268022 ..1..1..2....1..1..0....0..0..0....1..2..2....2..0..2....2..1..1....2..2..2
%Y A268022 Cf. A268026.
%K A268022 nonn
%O A268022 1,1
%A A268022 _R. H. Hardin_, Jan 24 2016