Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088947
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088947 Positions of records in A069862. +0
3
1, 2, 5, 7, 10, 13, 25, 27, 31, 37, 151, 277, 385, 451, 902, 6314, 6601, 16627, 24673, 30371, 31451, 32338, 36058, 41173, 44083, 44215, 47322, 52580 (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.

LINKS

C. Seggelin, Concatenation of Consecutive Integers.

EXAMPLE

f(31) = 110 which exceeds f(27) = 26; f(451) = 100270; f(902) = 999100.

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, A088343 (for records themselves).

Sequence in context: A067008 A094065 A073593 this_sequence A071113 A071704 A094019

Adjacent sequences: A088944 A088945 A088946 this_sequence A088948 A088949 A088950

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 29 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 December 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research