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

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066600 Sum of the digits in the n-th row of Pascal's triangle. 2
 1, 2, 4, 8, 16, 14, 28, 38, 67, 80, 43, 86, 127, 164, 94, 152, 178, 248, 298, 362, 337, 332, 385, 446, 451, 398, 499, 602, 574, 698, 703, 794, 805, 854, 1015, 1040, 1135, 1226, 1201, 1286, 1330, 1400, 1531, 1640, 1687, 1754, 1861, 2102, 2161, 2450, 2074 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Harry J. Smith, Table of n, a(n) for n = 0..1000 EXAMPLE The 7th row in Pascal's triangle is 1, 7, 21, 35, 35, 21, 7, 1 and the sum of the digits is 38 hence a(7) = 38. MATHEMATICA f[n_] := Block[{m = s = 0}, While[m < n + 1, s = s + Apply[ Plus, IntegerDigits[ Binomial[n, m]]]; m++ ]; Return[s]]; Table[ f[n], {n, 0, 50}] PROG (PARI) SumD(x)= { local(s=0); while (x>9, s+=x%10; x\=10); return(s + x) } { for (n=0, 1000, a=0; for (m=0, floor((n-1)/2), a+=2*SumD(binomial(n, m))); if (n%2 == 0, a+=SumD(binomial(n, n/2))); write("b066600.txt", n, " ", a) ) } \\ Harry J. Smith, Mar 08 2010 CROSSREFS Sequence in context: A334629 A108565 A066005 * A210025 A309571 A210023 Adjacent sequences: A066597 A066598 A066599 * A066601 A066602 A066603 KEYWORD base,easy,nonn AUTHOR Amarnath Murthy, Dec 22 2001 EXTENSIONS Corrected and extended by Robert G. Wilson v, Dec 28 2001 Offset changed from 1 to 0 by Harry J. Smith, Mar 08 2010 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.

Last modified December 1 18:28 EST 2022. Contains 358475 sequences. (Running on oeis4.)