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.

A110805 Sum of digits of n times number of digits of n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30
Offset: 1

Views

Author

Amarnath Murthy, Aug 14 2005

Keywords

Examples

			a(19) = 2 * (1 + 9) = 20.
a(1235) = 4 * (1 + 2 + 3 + 5) = 44.
		

Crossrefs

Programs

  • Mathematica
    Table[IntegerLength[n] * Total[IntegerDigits[n]], {n,50}] (* Harvey P. Dale, Jul 31 2012 *)
  • PARI
    a(n) = sumdigits(n) * #digits(n); \\ Michel Marcus, Feb 24 2017