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

%I #8 Jan 08 2018 15:08:12

%S 0,69,966,9936,44436777,888444222111,2222007555500,3333300366666006,

%T 555550050888880080,99999009006666600600,99999999978,

%U 666666666060999999999090,88888808008085555550500505,6666666660600033333333303000,555555550055550222222220022220

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

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

%e a(5) is 44436777 because its length-5 substrings (44436, 44367, 43677, 36777) are all distinct and divisible by 69 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 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)