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.

A069035 Smallest proper multiple of n with digit sum n.

Original entry on oeis.org

10, 20, 12, 40, 50, 24, 70, 80, 18, 190, 209, 48, 247, 266, 195, 448, 476, 198, 874, 3980, 399, 2398, 1679, 888, 4975, 1898, 999, 7588, 4988, 39990, 8959, 17888, 42999, 28798, 57995, 29988, 37999, 59888, 49998, 699880, 177899, 88998, 99889, 479996
Offset: 1

Views

Author

Amarnath Murthy, Apr 02 2002

Keywords

Crossrefs

Programs

  • Mathematica
    ssm[n_]:=Module[{k=2},While[Total[IntegerDigits[k*n]]!=n,k++];k*n]; Array[ ssm,50] (* Harvey P. Dale, Nov 24 2012 *)
  • PARI
    a(n) = {my(m=2*n); while (sumdigits(m) != n, m+=n); m;} \\ Michel Marcus, Feb 24 2016

Extensions

Offset corrected by Harvey P. Dale, Nov 24 2012