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

%I #6 Mar 30 2012 18:39:52

%S 0,9139,98845598,993211963315993,5505577077220228808866066,

%T 99998699998,66666608888880222222077777705555550,

%U 9999999133333339111111139999999,99999998844444445599999998,999999993211111111963333333315999999993

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

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

%e a(2) is 9139 because its length-2 substrings (91, 13, 39) are all distinct and divisible by 13 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

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 20 00:03 EDT 2024. Contains 371798 sequences. (Running on oeis4.)