Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093275
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093275 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 75. +0
1
0, 75, 9750, 997500, 99975000, 9999750000, 999997500000, 99999975000000 (list; graph; listen)
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: A134228 A110902 A114910 this_sequence A116527 A085404 A110100

Adjacent sequences: A093272 A093273 A093274 this_sequence A093276 A093277 A093278

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 December 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research