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!)
 A242314 Largest digital root in row n of Pascal's triangle. 3
 1, 1, 2, 3, 6, 5, 6, 8, 8, 9, 9, 6, 9, 9, 6, 9, 9, 8, 9, 9, 6, 9, 9, 8, 9, 9, 8, 9, 9, 9, 9, 9, 9, 9, 9, 8, 9, 9, 9, 9, 9, 9, 9, 9, 8, 9, 9, 9, 9, 9, 9, 9, 9, 8, 9, 9, 9, 9, 9, 9, 9, 9, 8, 9, 9, 9, 9, 9, 9, 9, 9, 8, 9, 9, 9, 9, 9, 9, 9, 9, 8, 9, 9, 9, 9, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(n) = maxA010888(A007318(n,k)): k=0..n) = max(A242312(n,k): k=0..n). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..1000 PROG (Haskell) a242314 = maximum . a242312_row CROSSREFS Cf. A242311. Sequence in context: A142151 A003968 A076734 * A242311 A097723 A187831 Adjacent sequences:  A242311 A242312 A242313 * A242315 A242316 A242317 KEYWORD nonn,base AUTHOR Reinhard Zumkeller, May 10 2014 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 July 28 19:33 EDT 2021. Contains 346335 sequences. (Running on oeis4.)