login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093267 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 67. 0
0, 67, 938, 88442211, 22244555, 30330980880, 77070778808088, 99999979, 888818181555595959, 999999099966666606664444440444, 7777770777022222202220, 999999999978, 44444440440449999999099099, 6666666066066011111110110110, 333333333333303555555555555505 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..15.

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 88442211 because its length-4 substrings (8844, 8442, 4422, 4221, 2211) are all distinct and divisible by 67 and there is no larger number with this property.

CROSSREFS

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

Sequence in context: A166802 A212557 A254640 * A032651 A322880 A157665

Adjacent sequences:  A093264 A093265 A093266 * A093268 A093269 A093270

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 7 11:56 EDT 2020. Contains 336276 sequences. (Running on oeis4.)