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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093250 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 50. 0
0, 500, 95000, 9950000, 999500000, 99995000000, 9999950000000, 999999500000000 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(3) is 95000 because its length-3 substrings (950, 500, 000) are all distinct and divisible by 50 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A045215 A194085 A005954 * A097425 A121577 A001244

Adjacent sequences:  A093247 A093248 A093249 * A093251 A093252 A093253

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 02:39 EST 2012. Contains 205567 sequences.