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

%I #8 Jan 08 2018 18:28:11

%S 0,947,4705,80846063,99969,772727889898,9999955,

%T 222200027777000711110001,999999965,99999999791111111161,99999999978,

%U 999999000090666666000060444444000040,55555500505552222220020222,2222222222200288888888888008,666666666660060555555555550050

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

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

%e a(4) is 80846063 because its length-4 substrings (8084, 0846, 8460, 4606, 6063) are all distinct and divisible by 47 and there is no larger number with this property.

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

%K base,nonn

%O 1,2

%A _Hans Havermann_, Mar 29 2004

%E a(11)-a(15) from _John Cerkan_, Jan 08 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 April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)