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.
%I A201379 #7 Jul 22 2025 16:12:34 %S A201379 2,4,19,27,115,122,467,433,1461,1208,3797,2931,8642,6292,17780,12430, %T A201379 33822,22825,60401,39688,102439,65739,166387,104780,260549,161323, %U A201379 395367,241382,583802,351915,841664,501871,1188050,701410,1645719,963241 %N A201379 Number of nX3 0..1 arrays with rows and columns lexicographically nondecreasing and the instance counts of every value within one of each other. %C A201379 Column 3 of A201384 %H A201379 R. H. Hardin, <a href="/A201379/b201379.txt">Table of n, a(n) for n = 1..210</a> %F A201379 Empirical: a(n) = 4*a(n-2) -3*a(n-4) -8*a(n-6) +14*a(n-8) -14*a(n-12) +8*a(n-14) +3*a(n-16) -4*a(n-18) +a(n-20) %e A201379 Some solutions for n=10 %e A201379 ..0..0..1....0..0..0....0..0..1....0..0..1....0..0..0....0..0..1....0..0..0 %e A201379 ..0..1..0....0..0..0....0..1..0....0..1..0....0..0..1....0..0..1....0..0..1 %e A201379 ..0..1..0....0..0..1....0..1..0....0..1..0....0..0..1....0..0..1....0..0..1 %e A201379 ..0..1..0....0..1..1....0..1..1....0..1..0....0..1..0....0..0..1....0..0..1 %e A201379 ..0..1..1....0..1..1....0..1..1....1..0..0....0..1..0....0..1..1....0..0..1 %e A201379 ..1..0..0....0..1..1....1..0..0....1..0..0....0..1..0....1..0..0....0..1..1 %e A201379 ..1..0..1....0..1..1....1..0..0....1..0..1....1..0..1....1..0..1....1..0..1 %e A201379 ..1..1..0....1..0..0....1..0..1....1..1..0....1..1..0....1..0..1....1..1..0 %e A201379 ..1..1..0....1..1..0....1..1..0....1..1..0....1..1..1....1..0..1....1..1..0 %e A201379 ..1..1..0....1..1..1....1..1..0....1..1..1....1..1..1....1..1..0....1..1..1 %K A201379 nonn %O A201379 1,1 %A A201379 _R. H. Hardin_ Nov 30 2011