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.

Original entry on oeis.org

12, 142, 835, 5798, 124932, 853467, 6536382, 50852019, 1234849644, 9043402501, 73007772802, 593742784829, 4859761676391, 125320157443726, 953467954114363, 7939655757745265, 66368199913921497, 556704809728838604, 4684478925507420069, 125076091920076709793
Offset: 1

Views

Author

Parthasarathy Nambi, Dec 06 2007

Keywords

Examples

			Sum of all 1-digit Riordan numbers is 1 + 0 + 1 + 1 + 3 + 6 = 12.
Sum of all 2-digit Riordan numbers is 15 + 36 + 91 = 142.
Sum of all 3-digit Riordan numbers is 232 + 603 = 835.
		

Crossrefs

Cf. A005043.

Programs

  • Mathematica
    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 *)

Extensions

More terms from Amiram Eldar, Nov 30 2019