A061760 -id:A061760 - cp's OEIS frontend

A309631 a(n) is the smallest positive integer divisible by n such that it is possible to strike out a digit from its decimal expansion (apart from trailing zeros) so that the resulting number is nonzero and divisible by n.

11, 12, 33, 24, 15, 36, 77, 48, 99, 110, 121, 132, 143, 154, 105, 176, 187, 108, 2109, 120, 231, 242, 253, 264, 125, 286, 297, 728, 3219, 330, 341, 352, 363, 374, 315, 396, 4107, 2128, 4329, 240, 451, 462, 473, 484, 405, 2530, 5217, 1344, 5439, 150, 561, 572, 583

Offset: 1

Bernard Schott, Sep 22 2019

The idea of this sequence comes from a problem in the annual Moscow Mathematical Olympiad (MMO) in 2004: problem 3, Level D. The problem asks for a proof that for any positive n, there exists a number m divisible by n such that it is possible to strike out a certain digit d (not a trailing zero) from its decimal expansion so that the number thus obtained will also be divisible by n and nonzero. Here, the sequence proposes to find the smallest such integer m called a(n).

			a(6) = 36 because 36 and 6 are divisible by 6, and there is no integer < 36 with this property.
a(19) = 2109 because 2109 = 19*111 and, if we strike out "1", 209 = 19*11 also is divisible by 19, and there is no integer < 2109 with this property.

Rémy Sigrist, Table of n, a(n) for n = 1..10000
Roman Fedorov, Alexei Belov, Alexander Kovaldzhi, Ivan Yashchenko, Moscow Mathematical Olympiads, 2000-2005, Problem 3, Level D, 2004, MSRI, 2011, p. 21 and 130/13 (only cover).

Cf. A061760.

del[n_] := Block[{m = 10^IntegerExponent[n, 10], d}, d = IntegerDigits[n/m]; Table[ FromDigits[ Delete[d, k]] m, {k, Length@d}]]; a[n_] := Block[{k=n, v}, While[! AnyTrue[del[k], # > 0 && Mod[#, n] == 0 &], k += n]; k]; Array[a, 55] (* Giovanni Resta, Sep 22 2019 *)

More terms from Giovanni Resta, Sep 22 2019

A075559 Smallest multiple of n not equal to n ending in (digits of) n.

Original entry on oeis.org

11, 12, 33, 24, 15, 36, 77, 48, 99, 110, 1111, 312, 1313, 714, 315, 416, 1717, 918, 1919, 120, 2121, 1122, 2323, 624, 125, 1326, 2727, 728, 2929, 330, 3131, 832, 3333, 1734, 735, 936, 3737, 1938, 3939, 240, 4141, 2142, 4343, 1144, 945, 2346, 4747, 1248, 4949

Offset: 1

Amarnath Murthy, Sep 24 2002

Harvey P. Dale, Table of n, a(n) for n = 1..1001

Cf. A061760.

edn[n_]:=Module[{k=2},While[Take[IntegerDigits[k*n],-IntegerLength[n]] != IntegerDigits[n],k++];k*n]; Array[edn,50] (* Harvey P. Dale, Jun 22 2022 *)

More terms from Ray Chandler, Oct 12 2003

Offset corrected by Sean A. Irvine, Feb 26 2025

cp's OEIS Frontend

A309631 a(n) is the smallest positive integer divisible by n such that it is possible to strike out a digit from its decimal expansion (apart from trailing zeros) so that the resulting number is nonzero and divisible by n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions