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 A269434 #4 Feb 26 2016 07:47:17 %S A269434 8,64,512,4068,32152,252932,1981512,15465934,120310016,933059856, %T A269434 7216323640,55670133422,428465939112,3290601897928,25221303496496, %U A269434 192953793764769,1473623863797808,11236105478130612,85542959337048488 %N A269434 Number of length-n 0..7 arrays with no repeated value greater than the previous repeated value. %C A269434 Column 7 of A269435. %H A269434 R. H. Hardin, <a href="/A269434/b269434.txt">Table of n, a(n) for n = 1..210</a> %F A269434 Empirical: a(n) = 56*a(n-1) -1364*a(n-2) +18816*a(n-3) -159866*a(n-4) +846328*a(n-5) -2642416*a(n-6) +3954888*a(n-7) -157507*a(n-8) -3954888*a(n-9) -2642416*a(n-10) -846328*a(n-11) -159866*a(n-12) -18816*a(n-13) -1364*a(n-14) -56*a(n-15) -a(n-16) %e A269434 Some solutions for n=5 %e A269434 ..6. .2. .3. .3. .2. .7. .4. .6. .2. .5. .1. .4. .5. .5. .4. .1 %e A269434 ..5. .2. .3. .5. .3. .0. .0. .5. .6. .3. .7. .1. .3. .5. .0. .2 %e A269434 ..2. .3. .5. .7. .1. .3. .4. .1. .2. .7. .1. .3. .6. .1. .7. .5 %e A269434 ..1. .1. .1. .1. .6. .1. .3. .5. .1. .1. .6. .7. .0. .0. .6. .0 %e A269434 ..0. .5. .7. .7. .5. .0. .5. .3. .3. .5. .5. .7. .6. .3. .2. .1 %Y A269434 Cf. A269435. %K A269434 nonn %O A269434 1,1 %A A269434 _R. H. Hardin_, Feb 26 2016