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 A213298 #4 Jun 15 2012 03:54:41 %S A213298 1,10,100,865,6805,47590,297595,1662160,8418649,39598078,178880725, %T A213298 795246055,3519278713,15573399301,69314501935,311040898945, %U A213298 1411268823196,6478030875460,30129403442530,141971859499360,678365095896001,3285531463054108,16137537771997720 %N A213298 Number of n-length words w over 10-ary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z. %Y A213298 Column k=10 of A213276. %K A213298 nonn %O A213298 0,2 %A A213298 _Alois P. Heinz_, Jun 08 2012