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 A269437 #8 Jan 22 2019 07:46:33 %S A269437 28,222,964,2995,7536,16408,32152,58149,98740,159346,246588,368407, %T A269437 534184,754860,1043056,1413193,1881612,2466694,3188980,4071291, %U A269437 5138848,6419392,7943304,9743725,11856676,14321178,17179372,20476639,24261720 %N A269437 Number of length-5 0..n arrays with no repeated value greater than the previous repeated value. %H A269437 R. H. Hardin, <a href="/A269437/b269437.txt">Table of n, a(n) for n = 1..210</a> %F A269437 Empirical: a(n) = n^5 + 5*n^4 + (17/2)*n^3 + 8*n^2 + (9/2)*n + 1. %F A269437 Conjectures from _Colin Barker_, Jan 22 2019: (Start) %F A269437 G.f.: x*(28 + 54*x + 52*x^2 - 19*x^3 + 6*x^4 - x^5) / (1 - x)^6. %F A269437 a(n) = 6*a(n-1) - 15*a(n-2) + 20*a(n-3) - 15*a(n-4) + 6*a(n-5) - a(n-6) for n>6. %F A269437 (End) %e A269437 Some solutions for n=8: %e A269437 ..2. .3. .5. .5. .2. .7. .6. .3. .8. .3. .7. .2. .1. .8. .6. .8 %e A269437 ..1. .4. .4. .3. .3. .4. .4. .4. .7. .5. .1. .2. .1. .1. .6. .2 %e A269437 ..5. .0. .6. .4. .2. .8. .6. .0. .2. .0. .5. .4. .1. .0. .1. .7 %e A269437 ..0. .2. .7. .6. .4. .4. .1. .0. .4. .7. .8. .3. .4. .3. .7. .4 %e A269437 ..3. .3. .4. .7. .5. .1. .7. .3. .5. .3. .0. .4. .0. .6. .5. .8 %Y A269437 Row 5 of A269435. %K A269437 nonn %O A269437 1,1 %A A269437 _R. H. Hardin_, Feb 26 2016