The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A190600 Maximal digit in base-12 expansion of n. 2


%S 0,1,2,3,4,5,6,7,8,9,10,11,1,1,2,3,4,5,6,7,8,9,10,11,2,2,2,3,4,5,6,7,

%T 8,9,10,11,3,3,3,3,4,5,6,7,8,9,10,11,4,4,4,4,4,5,6,7,8,9,10,11,5,5,5,

%U 5,5,5,6,7,8,9,10,11,6,6,6,6,6,6,6,7,8,9,10,11,7,7,7,7,7,7,7,7,8,9,10,11,8,8,8,8,8

%N Maximal digit in base-12 expansion of n.

%H Reinhard Zumkeller, <a href="/A190600/b190600.txt">Table of n, a(n) for n = 0..10000</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Duodecimal.html">Duodecimal</a>

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Duodecimal">Duodecimal</a>

%t Max[#]&/@IntegerDigits[Range[0,100],12] (* _Harvey P. Dale_, Apr 01 2020 *)

%o (Haskell)

%o import Numeric (showIntAtBase)

%o import Data.Char (intToDigit, digitToInt)

%o a190600 = digitToInt . maximum . flip (showIntAtBase 12 intToDigit) ""

%o -- _Reinhard Zumkeller_, May 14 2011

%o (PARI) a(n) = if (n, vecmax(digits(n, 12)), 0); \\ _Michel Marcus_, Jul 19 2020

%Y Cf. A054055.

%K nonn,base

%O 0,3

%A _N. J. A. Sloane_, May 13 2011

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 26 12:29 EST 2020. Contains 338639 sequences. (Running on oeis4.)