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.

A061760 Least multiple of n that is greater than n, not equal to a power of 10 times n and contains all the digits of n.

Original entry on oeis.org

11, 12, 33, 24, 15, 36, 77, 48, 99, 110, 121, 132, 143, 154, 105, 176, 187, 108, 912, 120, 126, 242, 253, 264, 125, 286, 297, 728, 928, 330, 341, 352, 363, 374, 315, 396, 703, 836, 936, 240, 164, 294, 344, 484, 405, 644, 1457, 384, 294, 150, 153, 572, 583
Offset: 1

Views

Author

Amarnath Murthy, May 20 2001

Keywords

Examples

			a(14) = 154 = 14*11 and contains the digits 1 and 4.
		

Programs

  • Mathematica
    lmn[n_]:=Module[{k=2,dcn=DigitCount[n]},While[Min[DigitCount[k*n]-dcn]<0||Divisible[k,10],k++];k*n]; Array[lmn,60] (* Harvey P. Dale, May 02 2015 *) (* WARNING Sometimes incorrect for n>=102, Sean A. Irvine, Mar 24 2023 *)

Extensions

Corrected and extended by Matthew Conroy, May 28 2001