login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054055 Largest digit of n. 76
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 2, 2, 2, 3, 4, 5, 6, 7, 8, 9, 3, 3, 3, 3, 4, 5, 6, 7, 8, 9, 4, 4, 4, 4, 4, 5, 6, 7, 8, 9, 5, 5, 5, 5, 5, 5, 6, 7, 8, 9, 6, 6, 6, 6, 6, 6, 6, 7, 8, 9, 7, 7, 7, 7, 7, 7, 7, 7, 8, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 2, 3, 4 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

A095815(n) = n + a(n).  [Reinhard Zumkeller, Aug 23 2011]

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

EXAMPLE

a(12)=2 because 1<2

MAPLE

[seq(max(convert(n, base, 10)), n=0..120)];

MATHEMATICA

f[n_] := Sort[IntegerDigits[n]][[-1]]; Array[f, 105, 0] (* From Alonso del Arte, May 14 2011 *) (* and revised by Robert G. Wilson v, Aug 24 2011 *)

PROG

(Haskell)

import Data.Char (digitToInt)

a054055 :: Integer -> Int

a054055 = digitToInt . maximum . show -- Reinhard Zumkeller, May 14 2011

(PARI) a(n)=vecmax(eval(Vec(Str(n)))) \\ Charles R Greathouse IV, Jun 16 2011

(MAGMA) [n eq 0 select 0 else Maximum(Intseq(n)): n in [0..104]];  // Bruno Berselli, Aug 24 2011

CROSSREFS

For bases 3 through 12 see A190592, A190593, A190594, A190595, A190596, A190597, A190598, A054055, A190599, A190600.

Sequence in context: A113230 A065881 A133048 * A067456 A052429 A051802

Adjacent sequences:  A054052 A054053 A054054 * A054056 A054057 A054058

KEYWORD

base,easy,nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Apr 29 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 18:54 EST 2012. Contains 205939 sequences.