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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093241 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 41. 0
0, 82, 8615, 9881599, 999589995, 555550999990888880, 77777003333300, 8888800055555000, 888880000999990000555550000, 9999999958999999995 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 9881599 because its length-4 substrings (9881, 8815, 8159, 1599) are all distinct and divisible by 41 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A116123 A116142 A054214 * A176024 A204976 A204703

Adjacent sequences:  A093238 A093239 A093240 * A093242 A093243 A093244

KEYWORD

base,nonn

AUTHOR

Hans Havermann (gladhobo(AT)teksavvy.com), Mar 28 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 13 15:00 EST 2012. Contains 205519 sequences.