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 A269408 #4 Feb 25 2016 14:37:57 %S A269408 8,64,504,3948,30744,238224,1837752,14121282,108123624,825227424, %T A269408 6279994728,47663522844,360868232424,2726022470928,20549497120776, %U A269408 154606709405835,1161096042133440,8705061811230400,65160664171875440 %N A269408 Number of length-n 0..7 arrays with no repeated value greater than or equal to the previous repeated value. %C A269408 Column 7 of A269409. %H A269408 R. H. Hardin, <a href="/A269408/b269408.txt">Table of n, a(n) for n = 1..210</a> %F A269408 Empirical: a(n) = 56*a(n-1) -1344*a(n-2) +17752*a(n-3) -135716*a(n-4) +545496*a(n-5) -463792*a(n-6) -4675336*a(n-7) +12240018*a(n-8) +21847336*a(n-9) -72913568*a(n-10) -123833976*a(n-11) +152002508*a(n-12) +520479176*a(n-13) +513890832*a(n-14) +230592040*a(n-15) +40353607*a(n-16) %e A269408 Some solutions for n=5 %e A269408 ..6. .0. .0. .4. .7. .2. .6. .3. .2. .6. .6. .4. .4. .3. .1. .5 %e A269408 ..6. .1. .7. .7. .1. .1. .3. .4. .0. .2. .6. .7. .2. .0. .1. .2 %e A269408 ..7. .7. .6. .4. .5. .6. .4. .2. .5. .5. .5. .1. .4. .6. .2. .4 %e A269408 ..5. .7. .5. .4. .1. .2. .3. .3. .5. .2. .1. .6. .5. .1. .0. .0 %e A269408 ..0. .3. .1. .7. .7. .4. .3. .1. .1. .7. .0. .3. .3. .1. .3. .0 %Y A269408 Cf. A269409. %K A269408 nonn %O A269408 1,1 %A A269408 _R. H. Hardin_, Feb 25 2016