cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A135326 Sum of all n-digit terms of A005043.

This page as a plain text file.
%I A135326 #17 Nov 30 2019 06:10:44
%S A135326 12,142,835,5798,124932,853467,6536382,50852019,1234849644,9043402501,
%T A135326 73007772802,593742784829,4859761676391,125320157443726,
%U A135326 953467954114363,7939655757745265,66368199913921497,556704809728838604,4684478925507420069,125076091920076709793
%N A135326 Sum of all n-digit terms of A005043.
%e A135326 Sum of all 1-digit Riordan numbers is 1 + 0 + 1 + 1 + 3 + 6 = 12.
%e A135326 Sum of all 2-digit Riordan numbers is 15 + 36 + 91 = 142.
%e A135326 Sum of all 3-digit Riordan numbers is 232 + 603 = 835.
%t A135326 digNum[n_] := Length @ IntegerDigits[n];rio[0] = 1; rio[1] = 0; rio[n_] := rio[n] = (n - 1)*(2*rio[n - 1] + 3*rio[n - 2])/(n + 1); digCount = 0; sum = 0; cumsum = {}; Do[r = rio[n]; If[digNum[r] > digCount, digCount++; AppendTo[cumsum, sum]]; sum += r, {n, 0, 50}]; Differences[cumsum] (* _Amiram Eldar_, Nov 30 2019 *)
%Y A135326 Cf. A005043.
%K A135326 nonn,base,less
%O A135326 1,1
%A A135326 _Parthasarathy Nambi_, Dec 06 2007
%E A135326 More terms from _Amiram Eldar_, Nov 30 2019