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 A268237 #18 Feb 27 2016 11:36:13 %S A268237 4,4,4,4,5,4,4,4,4,5,6,7,8,9,5,11,6,13,7,5,5,5,5,5,5,6,6,6,6,5,7,7,7, %T A268237 7,5,8,8,8,8,5,9,9,9,9,10,5,5,5,11,5,11,11,12,7,5,12,13,12,6,5,14,6,6, %U A268237 6,6,6,14,7,16,5,5,5,17,5,5,16,18,7,7,5,19,7,6,7,20,9,18,18,21,5,19,19,22,19,5,5,23,5,5,5,6 %N A268237 From the Fouriest transform of n: write n in that base b >= 4 which maximizes the number of 4's; in case of a tie pick the smallest b; sequence gives the base b. %C A268237 If no base b gives any 4's then we take b=4. %C A268237 a(n) > 4 for n >= 9 since 14 is n written in base n-4. - _Chai Wah Wu_, Feb 06 2016 %H A268237 Chai Wah Wu, <a href="/A268237/b268237.txt">Table of n, a(n) for n = 0..10000</a> %H A268237 Nathan Fox, <a href="/A268236/a268236_10000.txt">First 10000 terms of A268236, A268237, A268238</a>. Square brackets are used to separate the "digits" of A268236, since for n >= 66 these can be greater than 10. %H A268237 Zach Weinersmith, <a href="http://www.smbc-comics.com/?id=2874">Fouriest number</a>, SMBC (Saturday Morning Breakfast Cereal) column, Feb 01, 2013. %Y A268237 Cf. A268236 (Fouriest transform of n), A268238 (number of 4's). %K A268237 nonn,base %O A268237 0,1 %A A268237 _Jake Baron_, _Patrick Devlin_, _Nathan Fox_, and _N. J. A. Sloane_, Feb 06 2016