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

%I #11 Nov 01 2017 18:32:53

%S 0,72,9720,8892880,988920880,888984888084888,988898408880840888,

%T 998889840088808400888,999888984000888084000888,

%U 999988898400008880840000888,999998889840000088808400000888,999999888984000000888084000000888,999999988898400000008880840000000888

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

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

%e a(4) = 8892880 because its length-4 substrings (8892, 8928, 9288, 2880) are all distinct and divisible by 36 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_, Oct 25 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 18 04:56 EDT 2024. Contains 371767 sequences. (Running on oeis4.)