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!)
A093267 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 67. 0

%I #8 Jan 08 2018 15:08:26

%S 0,67,938,88442211,22244555,30330980880,77070778808088,99999979,

%T 888818181555595959,999999099966666606664444440444,

%U 7777770777022222202220,999999999978,44444440440449999999099099,6666666066066011111110110110,333333333333303555555555555505

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

%H Hans Havermann, <a href="/A093211/a093211.txt">Table of A093211-A093299</a>

%e 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.

%Y Cf. A093211, A093212, ..., A093299.

%K base,nonn

%O 1,2

%A _Hans Havermann_, Mar 29 2004

%E a(11)-a(15) from _John Cerkan_, Jan 08 2018

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 24 11:16 EDT 2024. Contains 371936 sequences. (Running on oeis4.)