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

%I #12 May 21 2017 19:45:20

%S 0,98428,7560280,991288484424228288,57750400406006020020,

%T 9999782222082222,773773000200200060060004004000,

%U 99999998444444428888888422222228444444,8888887706666660008888880006666660,999999991288888888484444444424222222228288888888

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

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

%e a(2) is 98428 because its length-2 substrings (98, 84, 42, 28) are all distinct and divisible by 14 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(9)-a(10) from _John Cerkan_, May 21 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 25 11:39 EDT 2024. Contains 371969 sequences. (Running on oeis4.)