login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A263623 a(1)=1; thereafter, a(n) = smallest k such that the decimal concatenation [a(n-2)+1 a(n-2)+2, ... a(n-1)] divides the decimal concatenation [a(n-1)+1 a(n-1)+2 ... k]. 1
1, 2, 4, 8, 36 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(6), if it exists, is > 10^6. - Lars Blomberg, Dec 01 2016

LINKS

Table of n, a(n) for n=1..5.

EXAMPLE

n=3: a(3) = 4 because k=4 is the smallest number such that 2 divides the concatenation 345...k.

n=4: a(4) = 8 because k=8 is the smallest number such that 34 divides the concatenation 567...k. See A002782 for the relevant concatenations.

CROSSREFS

Cf. A002782.

Sequence in context: A094334 A138744 A243547 * A070897 A180154 A320025

Adjacent sequences: A263620 A263621 A263622 * A263624 A263625 A263626

KEYWORD

nonn,base,more

AUTHOR

N. J. A. Sloane, Oct 23 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 12:01 EST 2022. Contains 358634 sequences. (Running on oeis4.)