A088870 -id:A088870 - cp's OEIS frontend

A069862 Smallest k such that n divides the concatenation of numbers from (n+1) to (n+k), where (n+1) is on the most significant side.

1, 2, 2, 2, 5, 2, 9, 4, 8, 10, 10, 8, 22, 16, 5, 4, 2, 8, 3, 20, 20, 10, 17, 12, 25, 22, 26, 16, 25, 20, 110, 20, 11, 2, 20, 8, 998, 52, 38, 20, 60, 20, 4, 32, 35, 42, 50, 20, 96, 50, 2, 96, 93, 26, 10, 20, 3, 50, 44, 20, 46, 40, 45, 40, 50, 32, 86, 32, 17, 20, 75, 72, 26, 926, 50

Offset: 1

Amarnath Murthy, Apr 18 2002

Minimum number of consecutive subsequent integers after n that must be concatenated together in ascending order such that n divides the concatenated term.

Concatenation always begins at n+1. Note that multiples of 11 seems to require more terms than any other number. 385 requires 9860. 451 requires 100270 terms be concatenated together into a 495,000 digit number. - Chuck Seggelin, Oct 29 2003; corrected by Chai Wah Wu, Oct 19 2014

			a(7) = 9 as 7 divides 8910111213141516 the concatenation of numbers from 8(= 7+1) to 16 (= 7+9).
a(5) = 5 because 5 will divide the number formed by concatenating the 5 integers after 5 in ascending order (i.e. 678910). a(385) = 9860 because 385 will divide the concatenation of 386,387,388,...,10245.

Chai Wah Wu, Table of n, a(n) for n = 1..10000
C. Seggelin, Concatenation of Consecutive Integers.

Cf. A069860, A069861, A088797, A088799, A088868, A088870, A088872, A088885.

Records are in A088947, A088343.

c[1] := 1:for n from 2 to 172 do k := 1:g := (n+k) mod n:while(true) do k := k+1:b := convert(n+k,base,10):g := (g*10^nops(b)+n+k) mod n: if((g mod n)=0) then c[n] := k:break:fi:od:od:seq(c[l],l=1..172);

f[n_] := Block[{k = n + 1}, d = k; While[ !IntegerQ[d/n], k++; d = d*10^Floor[Log[10, k] + 1] + k]; k - n]; Table[ f[n], {n, 1, 75}] (* Robert G. Wilson v, Nov 04 2003 *)

def A069862(n):
    nk, kr, r = n+1, 1, 1 if n > 1 else 0
    while r:
        nk += 1
        kr = (kr + 1) % n
        r = (r*(10**len(str(nk)) % n)+kr) % n
    return nk-n # Chai Wah Wu, Oct 20 2014

More terms from Sascha Kurz, Jan 28 2003

A088872 Numbers n which are divisors of the number produced by concatenating (n-10), (n-9), (n-8), ... (n-1) in that order.

Original entry on oeis.org

37, 1793, 12247, 13061, 12345679, 17675669, 59454523, 10035074789, 11207086103, 12174047803, 13606288721, 14036302277, 17989804447, 19541987747, 20070727459, 21841045129, 22431989513, 23140930781, 32217871691

Offset: 1

Chuck Seggelin, Oct 20 2003

			a(1)=37 because 37 is a factor of 27282930313233343536.

Cf. A069860, A088797, A088798, A088799, A088800, A088868, A088869, A088870, A088871.

More terms from David Wasserman, Aug 25 2005

A088869 Numbers n which are divisors of the number produced by concatenating (n-1), (n-2), ... (n-5) in that order.

Original entry on oeis.org

5, 15, 197, 591, 599, 985, 23363, 70089, 182415, 32533013, 97599039, 200814277564911, 334690462608185, 100208875079675883, 119690233947031245, 120541110603088381, 152213696825889183, 167014791799459805

Offset: 1

Chuck Seggelin, Oct 20 2003

			a(2)=15 because 15 is a factor of 1413121110.

Cf. A069860, A088797, A088798, A088799, A088800, A088868, A088870, A088871, A088872.

More terms from David Wasserman, Aug 26 2005

A088871 Numbers n which are divisors of the number produced by concatenating (n-1), (n-2), ... (n-10) in that order.

Original entry on oeis.org

10, 22, 55, 181, 190, 362, 905, 2035, 4070, 10490, 11203, 14686, 17833, 22406, 23065, 35666, 36715, 46130, 56015, 73430, 78421, 89165, 100705, 201410, 1004530, 1093165, 1425313, 1480309, 1695710, 1956190, 2186330, 2850626, 2882707

Offset: 1

Chuck Seggelin, Oct 20 2003

			a(2)=22 because 22 is a factor of 21201918171615141312.

Cf. A069860, A088797, A088798, A088799, A088800, A088868, A088869, A088870, A088872.

More terms from David Wasserman, Aug 26 2005

A088886 Minimum number of consecutive previous nonnegative integers to n that must be concatenated together in ascending order such that n divides the concatenated term, or zero if n divides no such concatenation.

Original entry on oeis.org

1, 0, 2, 0, 0, 0, 2, 0, 8, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 0, 0, 0, 0, 0, 26, 0, 6, 0, 0, 0, 11, 0, 0, 0, 10, 0, 0, 0, 16, 0, 15, 0, 0, 0, 25, 0, 4, 0, 45, 0, 0, 0, 0, 0, 20, 0, 51, 0, 45, 0, 0, 0, 0, 0, 2, 0, 35, 0, 22, 0, 0, 0, 0, 0, 21, 0, 0, 0, 0, 0, 81, 0, 0, 0, 6, 0, 0, 0, 0, 0, 66, 0, 0, 0, 13

Offset: 1

Chuck Seggelin, Oct 29 2003

Concatenation always end at n-1 and cannot start further than n-n (zero). Hence the maximum value of a(n) is n.

			a(7) = 2 because 7 will divide the number formed by concatenating the 2 integers prior to 7 in ascending order (i.e. 56). a(6) = 0 because 6 will not divide 5, 45, 345, 2345, 12345, or 012345.

Cf. A088797, A088799, A088868, A088870, A088872, A088885.

cp's OEIS Frontend

A069862 Smallest k such that n divides the concatenation of numbers from (n+1) to (n+k), where (n+1) is on the most significant side.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Python

Extensions

A088872 Numbers n which are divisors of the number produced by concatenating (n-10), (n-9), (n-8), ... (n-1) in that order.

Views

Author

Keywords

Examples

Crossrefs

Extensions

A088869 Numbers n which are divisors of the number produced by concatenating (n-1), (n-2), ... (n-5) in that order.

Views

Author

Keywords

Examples

Crossrefs

Extensions

A088871 Numbers n which are divisors of the number produced by concatenating (n-1), (n-2), ... (n-10) in that order.

Views

Author

Keywords

Examples

Crossrefs

Extensions

A088886 Minimum number of consecutive previous nonnegative integers to n that must be concatenated together in ascending order such that n divides the concatenated term, or zero if n divides no such concatenation.

Views

Author

Keywords

Comments

Examples

Crossrefs