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!)
A242311 Largest digital sum in row n of Pascal's triangle. 3
1, 1, 2, 3, 6, 5, 6, 8, 11, 12, 9, 12, 18, 18, 13, 18, 21, 26, 27, 29, 31, 27, 32, 26, 30, 32, 34, 39, 30, 45, 45, 45, 39, 36, 51, 51, 54, 54, 45, 51, 54, 58, 58, 62, 76, 64, 69, 74, 84, 91, 78, 78, 82, 73, 81, 81, 75, 90, 92, 93, 81, 95, 97, 90, 99, 111 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = max(A007953(A007318(n,k)): k=0..n) = max(A096145(n,k): k=0..n).
PROG
(Haskell)
a242311 = maximum . a096145_row
(PARI) a(n) = vecmax(vector(n+1, k, sumdigits(binomial(n, k-1)))); \\ Michel Marcus, Jan 24 2022
CROSSREFS
Sequence in context: A003968 A076734 A242314 * A097723 A187831 A087786
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 18 22:34 EDT 2024. Contains 370951 sequences. (Running on oeis4.)