This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 5
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,25 COMMENTS If no base b gives any 4's then we take b=4. The first occurrence of any value m in this sequence is at position 5^m-1. a(n) > 0 for n >= 9 since 14 is n written in base n-4. - Chai Wah Wu, Feb 06 2016 LINKS Chai Wah Wu, Table of n, a(n) for n = 0..10000 Nathan Fox, First 10000 terms of A268236, A268237, A268238. Square brackets are used to separate the "digits" of A268236, since for n >= 66 these can be greater than 10. Zach Weinersmith, Fouriest number, SMBC (Saturday Morning Breakfast Cereal) column, Feb 01, 2013. CROSSREFS Cf. A268236 (Fouriest transform of n), A268237 (the base b). Sequence in context: A177704 A138191 A069291 * A081117 A129252 A022929 Adjacent sequences:  A268235 A268236 A268237 * A268239 A268240 A268241 KEYWORD nonn,base AUTHOR Jake Baron, Patrick Devlin, Nathan Fox, and N. J. A. Sloane, Feb 06 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 21 23:55 EDT 2019. Contains 327286 sequences. (Running on oeis4.)