login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093225 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 25. 0
0, 7500, 975000, 99750000, 9997500000, 999975000000, 99999750000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(2) is 7500 because its length-2 substrings (75, 50, 00) are all distinct and divisible by 25 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A258612 A258605 A258604 * A090742 A273382 A186938

Adjacent sequences:  A093222 A093223 A093224 * A093226 A093227 A093228

KEYWORD

base,nonn

AUTHOR

Hans Havermann, Mar 28 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 18 11:50 EDT 2022. Contains 353807 sequences. (Running on oeis4.)