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

%I #12 Jan 05 2018 02:56:09

%S 0,82,984,9922,888068880,999990888880,55555008888800,99999984,

%T 999999922,8888888806888888880,9999999999088888888880,

%U 555555555500888888888800,9999999999984,99999999999922,88888888888880688888888888880,99999999999999908888888888888880

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

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

%e a(5) is 888068880 because its length-5 substrings (88806, 88068, 80688, 06888, 68880) are all distinct and divisible by 82 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(16) from _John Cerkan_, Jan 04 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 09:56 EDT 2024. Contains 371967 sequences. (Running on oeis4.)