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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A242311 Largest digital sum in row n of Pascal's triangle. 3

%I

%S 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,

%T 34,39,30,45,45,45,39,36,51,51,54,54,45,51,54,58,58,62,76,64,69,74,84,

%U 91,78,78,82,73,81,81,75,90,92,93,81,95,97,90,99,111

%N Largest digital sum in row n of Pascal's triangle.

%C a(n) = max(A007953(A007318(n,k)): k=0..n) = max(A096145(n,k): k=0..n).

%H Reinhard Zumkeller, <a href="/A242311/b242311.txt">Table of n, a(n) for n = 0..1000</a>

%o (Haskell)

%o a242311 = maximum . a096145_row

%Y Cf. A242314.

%K nonn,base

%O 0,3

%A _Reinhard Zumkeller_, May 10 2014

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 28 17:43 EDT 2020. Contains 337393 sequences. (Running on oeis4.)