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 A268238 #21 Nov 24 2016 19:33:43 %S A268238 0,0,0,0,1,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,2,1,1,1,2,1, %T A268238 1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,2,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1, %U A268238 2,1,1,1,2,1,2,1,2,1,1,1,2,2,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,2,2 %N A268238 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 number of 4's. %C A268238 If no base b gives any 4's then we take b=4. %C A268238 The first occurrence of any value m in this sequence is at position 5^m-1. %C A268238 a(n) > 0 for n >= 9 since 14 is n written in base n-4. - _Chai Wah Wu_, Feb 06 2016 %H A268238 Chai Wah Wu, <a href="/A268238/b268238.txt">Table of n, a(n) for n = 0..10000</a> %H A268238 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 A268238 Zach Weinersmith, <a href="http://www.smbc-comics.com/?id=2874">Fouriest number</a>, SMBC (Saturday Morning Breakfast Cereal) column, Feb 01, 2013. %Y A268238 Cf. A268236 (Fouriest transform of n), A268237 (the base b). %K A268238 nonn,base %O A268238 0,25 %A A268238 _Jake Baron_, _Patrick Devlin_, _Nathan Fox_, and _N. J. A. Sloane_, Feb 06 2016