Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093282
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093282 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 82. +0
1
0, 82, 984, 9922, 888068880, 999990888880, 55555008888800, 99999984, 999999922, 8888888806888888880 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(5) is 888068880 because its length-5 substrings (88806, 88068, 80688, 06888, 68880) are all distinct and divisible by 82 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A160914 A083386 A160154 this_sequence A085439 A017798 A035736

Adjacent sequences: A093279 A093280 A093281 this_sequence A093283 A093284 A093285

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 4 08:07 EST 2009. Contains 170310 sequences.


AT&T Labs Research