Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093225
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093225 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 25. +0
1
0, 7500, 975000, 99750000, 9997500000, 999975000000, 99999750000000 (list; graph; listen)
OFFSET

1,2

LINKS

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: A023940 A116195 A051259 this_sequence A090742 A077096 A031137

Adjacent sequences: A093222 A093223 A093224 this_sequence A093226 A093227 A093228

KEYWORD

base,nonn

AUTHOR

Hans Havermann (pxp(AT)rogers.com), Mar 28 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research