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

%I #10 Jun 15 2017 01:58:05

%S 0,99,990,9900990,99990,99990099990,9999990,999999009999990,999999990,

%T 9999999900999999990,99999999990,99999999990099999999990,9999999999990

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

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

%e a(4) is 9900990 because its length-4 substrings 9900, 9009, 0099, 0990) are all distinct and divisible by 99 and there is no larger number with this property

%Y Cf. A093211, A093212, ..., A093298.

%K base,nonn,more

%O 1,2

%A _Hans Havermann_, Mar 29 2004

%E a(9)-a(13) from _John Cerkan_, Jun 14 2017

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 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)