cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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].

Original entry on oeis.org

1, 2, 4, 8, 36
Offset: 1

Views

Author

N. J. A. Sloane, Oct 23 2015

Keywords

Comments

a(6), if it exists, is > 10^6. - Lars Blomberg, Dec 01 2016
a(6) <= 86794654347484748866500883685475458354620023089553379437308257589024531796179370608623026912768. - Max Alekseyev, Dec 25 2024

Examples

			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