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.

A066308 a(n) = (sum of digits of n) * (product of digits of n).

Original entry on oeis.org

1, 4, 9, 16, 25, 36, 49, 64, 81, 0, 2, 6, 12, 20, 30, 42, 56, 72, 90, 0, 6, 16, 30, 48, 70, 96, 126, 160, 198, 0, 12, 30, 54, 84, 120, 162, 210, 264, 324, 0, 20, 48, 84, 128, 180, 240, 308, 384, 468, 0, 30, 70, 120, 180, 250, 330, 420, 520, 630, 0, 42, 96, 162, 240, 330
Offset: 1

Views

Author

Labos Elemer, Dec 13 2001

Keywords

Comments

a(n) can be greater than, less than, or equal to n; see Example section.

Examples

			For n = 12, a(12) = (1 + 2)*(1*2) = 3*2 = 6 < n;
for n = 19, a(19) = (1 + 9)*(1*9) = 90 > n;
for n = 135, a(135) =(1 + 3 + 5)*(1*3*5) = 135 = n.
		

Crossrefs

Programs

  • Mathematica
    asum[x_] := Apply[Plus, IntegerDigits[x]] apro[x_] := Apply[Times, IntegerDigits[x]] a[n]=asum[n]*apro[n]
    sdpd[n_]:=Module[{idn=IntegerDigits[n]},Total[idn]Times@@idn]; Array[ sdpd,70] (* Harvey P. Dale, Dec 31 2011 *)
  • PARI
    a(n) = my(d = digits(n)); vecsum(d) * vecprod(d); \\ Michel Marcus, Feb 24 2017

Extensions

Edited by Jon E. Schoenfield, Jul 09 2018