login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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
LINKS
FORMULA
a(n) = max(A010888(A007318(n,k)): k=0..n) = max(A242312(n,k): k=0..n).
PROG
(Haskell)
a242314 = maximum . a242312_row
CROSSREFS
Cf. A242311.
Sequence in context: A142151 A003968 A076734 * A242311 A097723 A187831
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 04:26 EDT 2024. Contains 370952 sequences. (Running on oeis4.)