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 A269406 #4 Feb 25 2016 14:36:27 %S A269406 6,36,210,1215,6960,39560,223320,1253190,6995660,38870136,215074596, %T A269406 1185563746,6512894520,35666937840,194765568024,1060744346079, %U A269406 5762980508994,31239002042780,168977143019910,912220049428041 %N A269406 Number of length-n 0..5 arrays with no repeated value greater than or equal to the previous repeated value. %C A269406 Column 5 of A269409. %H A269406 R. H. Hardin, <a href="/A269406/b269406.txt">Table of n, a(n) for n = 1..210</a> %F A269406 Empirical: a(n) = 30*a(n-1) -360*a(n-2) +2090*a(n-3) -4905*a(n-4) -5076*a(n-5) +41160*a(n-6) -9900*a(n-7) -151875*a(n-8) -6250*a(n-9) +300000*a(n-10) +281250*a(n-11) +78125*a(n-12) %e A269406 Some solutions for n=6 %e A269406 ..5. .0. .4. .3. .3. .1. .2. .4. .4. .1. .0. .0. .2. .2. .2. .0 %e A269406 ..2. .5. .2. .1. .5. .3. .5. .4. .0. .5. .3. .1. .3. .4. .5. .4 %e A269406 ..1. .0. .4. .5. .2. .0. .4. .2. .5. .2. .3. .5. .5. .1. .2. .2 %e A269406 ..2. .5. .4. .2. .4. .3. .0. .0. .5. .5. .1. .2. .4. .4. .5. .4 %e A269406 ..0. .4. .5. .0. .4. .5. .1. .0. .1. .4. .3. .1. .3. .5. .2. .5 %e A269406 ..3. .1. .3. .3. .3. .1. .0. .5. .2. .1. .0. .0. .1. .3. .2. .1 %Y A269406 Cf. A269409. %K A269406 nonn %O A269406 1,1 %A A269406 _R. H. Hardin_, Feb 25 2016