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!)
A093268 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 68. 0
0, 68, 3408, 10204080, 77792888, 888080444040, 55505008880800, 9990900088808000, 666663636888884848, 222220022044444004408888800880, 7777700770044444004400, 999999999936, 55555505555004444440444400, 9999999999190044444444448400, 666666666606660444444444404440 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Hans Havermann, Table of A093211-A093299
EXAMPLE
a(4) is 10204080 because its length-4 substrings (1020, 0204, 2040, 0408, 4080) are all distinct and divisible by 68 and there is no larger number with this property.
CROSSREFS
Cf. A093211, A093212, ..., A093299.
Sequence in context: A017731 A204298 A281556 * A231250 A159361 A004298
KEYWORD
base,nonn
AUTHOR
Hans Havermann, Mar 29 2004
EXTENSIONS
a(11)-a(15) from John Cerkan, Jan 08 2018
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 July 26 14:44 EDT 2024. Contains 374635 sequences. (Running on oeis4.)