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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A190598 Maximal digit in base-9 expansion of n. 1
 0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 1, 2, 3, 4, 5, 6, 7, 8, 2, 2, 2, 3, 4, 5, 6, 7, 8, 3, 3, 3, 3, 4, 5, 6, 7, 8, 4, 4, 4, 4, 4, 5, 6, 7, 8, 5, 5, 5, 5, 5, 5, 6, 7, 8, 6, 6, 6, 6, 6, 6, 6, 7, 8, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 2, 3, 4, 5, 6, 7, 8, 1, 1, 2, 3, 4, 5, 6, 7, 8, 2, 2, 2, 3, 4, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS FORMULA From Matej Veselovac, Jul 23 2021: (Start) a(n) = 1 iff n is in A033046. a(n) = 8 iff n is in A338090. (End) MATHEMATICA a[n_] := Max[IntegerDigits[n, 9]]; (* Matej Veselovac, Jul 23 2021 *) PROG (PARI) a(n) = if (n, vecmax(digits(n, 9)), 0); \\ Michel Marcus, Jul 19 2020 (Python) from sympy.ntheory.digits import digits def a(n): return max(digits(n, 9)[1:]) print([a(n) for n in range(105)]) # Michael S. Branicky, Jul 23 2021 CROSSREFS Cf. A007095 (base 9), A033046 (indices of 1's), A338090 (indices of 8's). Cf. A054055 (maximal digit in decimal). Sequence in context: A228822 A255829 A277547 * A338882 A053844 A010887 Adjacent sequences:  A190595 A190596 A190597 * A190599 A190600 A190601 KEYWORD nonn,base,easy,changed AUTHOR N. J. A. Sloane, May 13 2011 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 August 5 18:00 EDT 2021. Contains 346488 sequences. (Running on oeis4.)