Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093250
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093250 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 50. +0
1
0, 500, 95000, 9950000, 999500000, 99995000000, 9999950000000, 999999500000000 (list; graph; listen)
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: A132475 A045215 A005954 this_sequence A097425 A121577 A001244

Adjacent sequences: A093247 A093248 A093249 this_sequence A093251 A093252 A093253

KEYWORD

base,nonn

AUTHOR

Hans Havermann (pxp(AT)rogers.com), Mar 29 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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research