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

%I #8 Jan 08 2018 14:54:06

%S 0,65,8455,669555,99970,5550355550,77777705555550,2222220055555500,

%T 888888000555555000,66666600005555550000,99999999970,

%U 55555555055055555555055,77777777777705555555555550,2222222222220055555555555500,888888888888000555555555555000

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

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

%e a(4) is 669555 because its length-4 substrings (6695, 6955, 9555) are all distinct and divisible by 65 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 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)