login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
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 A373184 A097723
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, May 10 2014
STATUS
approved