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!)
A093269 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 69. 0
0, 69, 966, 9936, 44436777, 888444222111, 2222007555500, 3333300366666006, 555550050888880080, 99999009006666600600, 99999999978, 666666666060999999999090, 88888808008085555550500505, 6666666660600033333333303000, 555555550055550222222220022220 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..15.

Hans Havermann, Table of A093211-A093299

EXAMPLE

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.

CROSSREFS

Cf. A093211, A093212, ..., A093299.

Sequence in context: A264288 A113707 A259398 * A108147 A160788 A160815

Adjacent sequences:  A093266 A093267 A093268 * A093270 A093271 A093272

KEYWORD

base,nonn

AUTHOR

Hans Havermann, Mar 29 2004

EXTENSIONS

a(11)-a(15) from John Cerkan, Jan 08 2018

STATUS

approved

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 February 22 08:42 EST 2020. Contains 332133 sequences. (Running on oeis4.)