login
This site is supported by donations to The OEIS Foundation.

 

Logo


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 October 18 02:23 EDT 2019. Contains 328135 sequences. (Running on oeis4.)