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 A212941 #8 Apr 17 2022 21:53:33 %S A212941 1,152747323,28744943858947,2438624218076957695, %T A212941 153322267564381742818531,8389667096561737605103329223, %U A212941 427593510370812774462812710051387,20973117493971065058428815227499445215 %N A212941 Number of n X 6 0..5 arrays with no column j greater than or equal to than column j-1 in all rows. %C A212941 Column 6 of A212943. %H A212941 R. H. Hardin, <a href="/A212941/b212941.txt">Table of n, a(n) for n = 1..210</a> %F A212941 Empirical: a(n) = 130453*a(n-1) -6763333836*a(n-2) +185208872760324*a(n-3) -2991440828618168976*a(n-4) +29966228467174160130816*a(n-5) -189618846625740940674481152*a(n-6) +754213725094693350993932353536*a(n-7) -1831929539263722316502211827073024*a(n-8) +2545588680910314328406052486644760576*a(n-9) -1758206800538810904218951296840095498240*a(n-10) +418951577236630476027552063815969641857024*a(n-11). %F A212941 Empirical: a(n) = 6*15876^n -3*4536^n +2*1512^n +3136^n -5*27216^n -462^n -6*7056^n -9261^n +4*12096^n +2*2646^n +46656^n. - _R. J. Mathar_, Jun 27 2012 %e A212941 Some solutions for n=4 %e A212941 ..5..2..2..5..4..1....5..2..4..4..2..0....5..4..2..3..0..4....5..3..3..4..1..5 %e A212941 ..0..1..4..4..1..4....0..5..4..0..2..1....3..5..3..1..5..3....3..1..2..1..5..5 %e A212941 ..3..1..2..2..4..5....3..2..0..2..4..2....4..0..0..2..1..1....0..3..0..5..5..0 %e A212941 ..0..4..1..0..5..3....5..3..5..0..4..3....5..3..0..4..5..2....0..4..3..1..4..2 %Y A212941 Cf. A212943. %K A212941 nonn %O A212941 1,2 %A A212941 _R. H. Hardin_, May 31 2012