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 A206243 #11 Mar 30 2012 18:35:45 %S A206243 1,1,2,1,9,1,2,3,125,1,16,1,343,25,2,1,6561,1,25,49,14641,1,32,5, %T A206243 28561,3,49,1,1000,1,2,1331,1419857,49,1458,1,2476099,2197,50,1,49,1, %U A206243 2662,75,6436343,1,64,7,3125,4913,4394,1,177147,121,64,6859,20511149,1 %N A206243 In base n, you must write the first A206243(n) positive multiples of a(n) in order to write every base-n digit. %H A206243 David W. Wilson, <a href="/A206243/b206243.txt">Table of n, a(n) for n = 2..10000</a> %Y A206243 a(n) = n^k/A206242(n), where k is the least value making the right side an integer (T. Rockicki). %K A206243 nonn,base %O A206243 2,3 %A A206243 _David W. Wilson_, Feb 05 2012