login
This site is supported by donations 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 (list; graph; refs; listen; history; 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

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

Sequence in context: A173486 A204320 A204316 * A093798 A093218 A093215

Adjacent sequences:  A093227 A093228 A093229 * A093231 A093232 A093233

KEYWORD

base,nonn

AUTHOR

Hans Havermann (gladhobo(AT)teksavvy.com), Mar 28 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:10 EST 2012. Contains 205856 sequences.