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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093299 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 99. 88
0, 99, 990, 9900990, 99990, 99990099990, 9999990, 999999009999990, 999999990, 9999999900999999990, 99999999990, 99999999990099999999990, 9999999999990 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 9900990 because its length-4 substrings 9900, 9009, 0099, 0990) are all distinct and divisible by 99 and there is no larger number with this property

CROSSREFS

Cf. A093211, A093212, ..., A093298.

Sequence in context: A223157 A223155 A308466 * A196645 A196600 A074786

Adjacent sequences:  A093296 A093297 A093298 * A093300 A093301 A093302

KEYWORD

base,nonn,more

AUTHOR

Hans Havermann, Mar 29 2004

EXTENSIONS

a(9)-a(13) from John Cerkan, Jun 14 2017

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 December 7 19:34 EST 2021. Contains 349585 sequences. (Running on oeis4.)