The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093213 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 13. 2
0, 9139, 98845598, 993211963315993, 5505577077220228808866066, 99998699998, 66666608888880222222077777705555550, 9999999133333339111111139999999, 99999998844444445599999998, 999999993211111111963333333315999999993 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Hans Havermann, Table of A093211-A093299
EXAMPLE
a(2) is 9139 because its length-2 substrings (91, 13, 39) are all distinct and divisible by 13 and there is no larger number with this property
CROSSREFS
Cf. A093211, A093212, ..., A093299.
Sequence in context: A184381 A251376 A253031 * A205922 A256766 A210140
KEYWORD
base,nonn
AUTHOR
Hans Havermann, Mar 28 2004
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 May 23 16:36 EDT 2024. Contains 372765 sequences. (Running on oeis4.)