Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088343
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088343 Records in A069862. +0
3
1, 2, 5, 9, 10, 22, 25, 26, 110, 998, 1158, 1410, 9860, 100270, 999100, 1005274, 1007044, 1055274, 1059163, 1063242, 1065027, 1083148, 1099446, 1103722, 1144506, 10146315, 99992456, 99997120 (list; graph; listen)
OFFSET

1,2

COMMENT

A069862 is the 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. - Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 14 2003

LINKS

C. Seggelin, Concatenation of Consecutive Integers.

MATHEMATICA

f[n_] := Block[{k = n + 1}, d = k; While[ d != 0, k++; d = Mod[d*10^Floor[ Log[10, k] + 1] + k, n]]; k - n]; a = 0; Do[b = f[n]; If[b > a, a = b; Print[n, " = ", b]], {n, 1, 34500}]

CROSSREFS

Cf. A069862, A088947.

Sequence in context: A046711 A095347 A159073 this_sequence A110781 A115248 A005123

Adjacent sequences: A088340 A088341 A088342 this_sequence A088344 A088345 A088346

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Nov 14 2003

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com) and Chuck Seggelin (chuck(AT)plastereddragon.com), Nov 14 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research