|
%I #12 Dec 02 2018 23:14:35
%S 1,2,4,8,16,14,28,38,67,80,43,86,127,164,94,152,178,248,298,362,337,
%T 332,385,446,451,398,499,602,574,698,703,794,805,854,1015,1040,1135,
%U 1226,1201,1286,1330,1400,1531,1640,1687,1754,1861,2102,2161,2450,2074
%N Sum of the digits in the n-th row of Pascal's triangle.
%H Harry J. Smith, <a href="/A066600/b066600.txt">Table of n, a(n) for n = 0..1000</a>
%e 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.
%t 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}]
%o (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
%K base,easy,nonn
%O 0,2
%A _Amarnath Murthy_, Dec 22 2001
%E Corrected and extended by _Robert G. Wilson v_, Dec 28 2001
%E Offset changed from 1 to 0 by _Harry J. Smith_, Mar 08 2010
|
