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 A269433 #4 Feb 26 2016 07:46:33 %S A269433 7,49,343,2380,16408,112476,767172,5209554,35236110,237479970, %T A269433 1595378190,10686193980,71386033740,475694666700,3162645548916, %U A269433 20982275486907,138930896958189,918219765681883,6058251819231325,39906814296599320 %N A269433 Number of length-n 0..6 arrays with no repeated value greater than the previous repeated value. %C A269433 Column 6 of A269435. %H A269433 R. H. Hardin, <a href="/A269433/b269433.txt">Table of n, a(n) for n = 1..210</a> %F A269433 Empirical: a(n) = 42*a(n-1) -749*a(n-2) +7308*a(n-3) -41601*a(n-4) +133686*a(n-5) -198037*a(n-6) -2136*a(n-7) +198037*a(n-8) +133686*a(n-9) +41601*a(n-10) +7308*a(n-11) +749*a(n-12) +42*a(n-13) +a(n-14) %e A269433 Some solutions for n=6 %e A269433 ..0. .0. .0. .3. .5. .2. .5. .6. .6. .5. .3. .6. .0. .5. .6. .3 %e A269433 ..4. .0. .1. .0. .4. .2. .5. .2. .4. .1. .6. .3. .4. .4. .3. .1 %e A269433 ..6. .3. .6. .0. .0. .4. .0. .5. .0. .5. .0. .2. .3. .5. .3. .0 %e A269433 ..5. .6. .4. .6. .5. .0. .1. .2. .3. .6. .0. .0. .4. .4. .3. .2 %e A269433 ..4. .0. .5. .4. .0. .4. .3. .0. .2. .0. .4. .3. .6. .2. .5. .5 %e A269433 ..4. .3. .6. .5. .5. .6. .2. .4. .3. .1. .3. .0. .3. .6. .2. .6 %Y A269433 Cf. A269435. %K A269433 nonn %O A269433 1,1 %A A269433 _R. H. Hardin_, Feb 26 2016