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!)
A093230 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 30. 0
0, 900, 99000, 9990000, 999900000, 99999000000, 9999990000000, 999999900000000, 99999999000000000, 9999999990000000000, 999999999900000000000, 99999999999000000000000, 9999999999990000000000000, 999999999999900000000000000, 99999999999999000000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
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 30 and there is no larger number with this property.
CROSSREFS
Sequence in context: A356694 A359383 A374245 * A093798 A093218 A093215
KEYWORD
base,nonn
AUTHOR
Hans Havermann, Mar 28 2004
EXTENSIONS
a(11)-a(15) from John Cerkan, Jan 09 2018
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 August 31 13:44 EDT 2024. Contains 375567 sequences. (Running on oeis4.)