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”).
%I #25 Feb 10 2019 17:26:32
%S 0,2,4,8,11,20,22,32,31,52,56,80,79,100,94,128,137,176,172,208,193,
%T 244,254,320,266,340,283,400,407,332,466,512,499,580,569,680,667,724,
%U 745,848,821,872,904,976,1021,1060,1082,1280,1093,1312,1330,1360,1379,1472,1479,1584,1543
%N Row sums of A225043.
%H Nathan M Epstein, <a href="https://gist.github.com/Aeium/d776d6a0dedca23f4cb281548645df30">Python program</a>
%F a(A000040(n)) = A072205(n) for n > 0.
%t a[n_]:=Sum[Mod[Binomial[n, k],n+1], {k,0, n}]; Array[a, 100, 0] (* _Stefano Spezia_, Jan 09 2019 *)
%o (PARI) a(n) = sum(k=0, n, binomial(n,k) % (n+1)); \\ _Michel Marcus_, Jan 09 2019
%Y Cf. A000040, A062173, A072205, A225043.
%K nonn
%O 0,2
%A _Nathan M Epstein_, Jan 09 2019