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

%I #10 Jan 09 2018 14:33:32

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

%T 999999900000000,99999999000000000,5555555595555555550555555555,

%U 9555555559505555555505055555555,9955555555950055555555050055555555,9995555555595000555555550500055555555

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

%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 45 and there is no larger number with this property.

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

%K base,nonn

%O 1,2

%A _Hans Havermann_, Mar 28 2004

%E a(11)-a(13) 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 17:11 EDT 2024. Contains 375572 sequences. (Running on oeis4.)