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!)
A093218 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 18. 1
0, 900, 99000, 8892880288, 9889208802088, 9988920088020088, 9998892000880200088, 9999889200008802000088, 9999988920000088020000088, 9999998892000000880200000088, 9999999889200000008802000000088, 9999999988920000000088020000000088 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

For n > 3, is a(n) of the form [(n-4) 9's]8892[(n-4) 0's]8802[(n-4) 0's]88? - David A. Corneth, Oct 25 2017

LINKS

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

John Cerkan, Python 2.7

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(3) is 99000 because its length-3 substrings (990, 900, 000) are all distinct and divisible by 18 and there is no larger number with this property.

CROSSREFS

Cf. A093211, A093212, ..., A093299.

Sequence in context: A262847 A093230 A093798 * A093215 A252674 A158407

Adjacent sequences:  A093215 A093216 A093217 * A093219 A093220 A093221

KEYWORD

base,nonn

AUTHOR

Hans Havermann, Mar 28 2004

EXTENSIONS

a(12) from John Cerkan, Oct 25 2017

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 June 28 05:40 EDT 2022. Contains 354903 sequences. (Running on oeis4.)