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.

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, 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, 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

Offset

0,1

Comments

If no base b gives any 4's then we take b=4.

a(n) > 4 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), A268238 (number of 4's).

Sequence in context: A165923 A228729 A174444 * A276866 A331842 A006264

Adjacent sequences: A268234 A268235 A268236 * A268238 A268239 A268240

Keyword

nonn,base

Author

Jake Baron, Patrick Devlin, Nathan Fox, and N. J. A. Sloane, Feb 06 2016

Status

approved