login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093282 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 82. 0
0, 82, 984, 9922, 888068880, 999990888880, 55555008888800, 99999984, 999999922, 8888888806888888880 (list; graph; refs; listen; history; internal format)
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: A173356 A083386 A160154 * A085439 A017798 A035736

Adjacent sequences:  A093279 A093280 A093281 * A093283 A093284 A093285

KEYWORD

base,nonn

AUTHOR

Hans Havermann (gladhobo(AT)teksavvy.com), Mar 29 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 13:22 EST 2012. Contains 205801 sequences.