Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093280
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093280 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 80. +0
1
0, 800, 88000, 9920000, 999200000, 99992000000, 9999920000000, 999999200000000 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(3) is 88000 because its length-3 substrings (880, 800, 000) are all distinct and divisible by 80, and there is no larger number with this property

CROSSREFS

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

Adjacent sequences: A093277 A093278 A093279 this_sequence A093281 A093282 A093283

Sequence in context: A043404 A015065 A097206 this_sequence A093240 A093220 A035757

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research