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

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 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

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: A110902 A206696 A114910 * A116527 A085404 A110100

Adjacent sequences:  A093272 A093273 A093274 * A093276 A093277 A093278

KEYWORD

base,nonn

AUTHOR

Hans Havermann (gladhobo(AT)teksavvy.com), Mar 29 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 14 16:40 EST 2012. Contains 205635 sequences.