login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093215 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 15. 0
0, 900, 99000, 9885055505, 9988500555005, 9998850005550005, 9999885000055500005, 9999988500000555000005, 9999998850000005550000005, 9999999885000000055500000005, 9999999988500000000555000000005, 9999999998850000000005550000000005 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

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 15 and there is no larger number with this property.

CROSSREFS

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

Sequence in context: A093230 A093798 A093218 * A252674 A158407 A250782

Adjacent sequences:  A093212 A093213 A093214 * A093216 A093217 A093218

KEYWORD

base,nonn

AUTHOR

Hans Havermann, Mar 28 2004

EXTENSIONS

a(8)-a(11) from John Cerkan, May 22 2017

a(12) 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 13 04:20 EST 2019. Contains 329085 sequences. (Running on oeis4.)