login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093234 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 34. 0

%I

%S 0,68,30680,9010204080,11016660622202,888080444040222020,

%T 555050088808006660600,9999009088880080,666663636888884848,

%U 1111100110222220022044444004408888800880,7777777722244444444666,888888887880222222226220,55555555050504444444404040

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

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

%e a(3) is 30680 because its length-3 substrings (306, 068, 680) are all distinct and divisible by 34 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(11)-a(13) from _John Cerkan_, Aug 03 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 30 18:12 EDT 2020. Contains 337440 sequences. (Running on oeis4.)