login
The OEIS is supported by the many generous donors 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, 555555555509999999999088888888880, 777777777700333333333300, 88888888880005555555555000 (list; graph; refs; listen; history; text; 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 * A280361 A280671 A241129
KEYWORD
base,nonn
AUTHOR
Hans Havermann, Mar 28 2004
EXTENSIONS
a(11)-a(13) from John Cerkan, Oct 27 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 08:33 EDT 2024. Contains 371905 sequences. (Running on oeis4.)