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

%I #8 Jan 08 2018 16:24:55

%S 0,56,67280,90728008,773360088,88877688800,57750008008000,

%T 77774704000080080000,77777677600000800800000,

%U 77777790720000008008000000,77773773000000080080000000,88888888788088888888088088888888,77777757750000000008008000000000

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

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

%e a(3) is 67280 because its length-3 substrings (672, 728, 280) are all distinct and divisible by 56 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(13) 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 18 13:10 EDT 2024. Contains 371780 sequences. (Running on oeis4.)