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.

A067082 If n = abc...def in decimal notation then the right digit sum function = abc...def + bc...def + c...def + ... + def + ef + f.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 70, 72
Offset: 0

Views

Author

Amarnath Murthy, Jan 05 2002

Keywords

Examples

			a(256) = 256 + 56 + 6 = 318.
		

Crossrefs

Programs

  • Mathematica
    Table[d = IntegerDigits[n]; rd = 0; While[ Length[d] > 0, rd = rd + FromDigits[d]; d = Drop[d, 1]]; rd, {n, 0, 75} ]

Formula

a(abcd) = abcd+(abcd-1000a)+(abcd-1000a-100b)+(abcd-1000a-100b-10c).
n*length(n)-Sum_{k=1..length(n)} 10^k*floor(n/10^k). - Vladeta Jovovic, Jan 08 2002

Extensions

More terms from Robert G. Wilson v, Jan 07 2002