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

%I #9 Jan 09 2018 14:39:51

%S 0,900,99000,9990000,999900000,99999000000,9999990000000,

%T 999999900000000,99999999000000000,9999999990000000000,

%U 999999999900000000000,99999999999000000000000,9999999999990000000000000,999999999999900000000000000,99999999999999000000000000000

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

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

%e a(3) is 99000 because its length-3 substrings (990, 900, 000) are all distinct and divisible by 30 and there is no larger number with this property.

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

%K base,nonn

%O 1,2

%A _Hans Havermann_, Mar 28 2004

%E a(11)-a(15) from _John Cerkan_, Jan 09 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 August 31 15:16 EDT 2024. Contains 375572 sequences. (Running on oeis4.)