A093266 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 66.

0, 66, 7924, 8844884, 77748444, 88882288882, 77777704444440, 888888668888886, 777777000444444000, 8888888844888888884, 7777770000044444400000, 88888888882288888888882, 77777777777704444444444440, 888888888888668888888888886, 777777777777000444444444444000

Offset

1,2

Links

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

Hans Havermann, Table of A093211-A093299

Example

a(4) is 8844884 because its length-4 substrings (8844, 8448, 4488, 4884) are all distinct and divisible by 66 and there is no larger number with this property.

Crossrefs

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

Sequence in context: A099639 A003555 A283222 * A282247 A197439 A127706

Adjacent sequences: A093263 A093264 A093265 * A093267 A093268 A093269

Keyword

base,nonn

Author

Hans Havermann, Mar 29 2004

Extensions

a(11)-a(15) from John Cerkan, Jan 08 2018

Status

approved