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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093275 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 75. 0
0, 75, 9750, 997500, 99975000, 9999750000, 999997500000, 99999975000000, 9999999750000000, 999999997500000000, 99999999975000000000, 9999999999750000000000, 999999999997500000000000, 99999999999975000000000000, 9999999999999750000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 997500 because its length-4 substrings (9975, 9750, 7500) are all distinct and divisible by 75 and there is no larger number with this property.

CROSSREFS

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

Sequence in context: A248545 A114910 A294983 * A251242 A259464 A116527

Adjacent sequences:  A093272 A093273 A093274 * A093276 A093277 A093278

KEYWORD

base,nonn

AUTHOR

Hans Havermann, Mar 29 2004

EXTENSIONS

a(9)-a(15) from John Cerkan, Jan 05 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 December 9 09:21 EST 2019. Contains 329877 sequences. (Running on oeis4.)