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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093216 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 16. 0
0, 964800, 99288000, 99840000, 9998400000, 999984000000, 99999840000000, 9999998400000000, 999999984000000000, 99999999840000000000, 9999999998400000000000, 999999999984000000000000, 99999999999840000000000000, 9999999999998400000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(2) is 964800 because its length-2 substrings (96, 64, 48, 80, 00) are all distinct and divisible by 16 and there is no larger number with this property.

CROSSREFS

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

Sequence in context: A092377 A022236 A083609 * A272555 A121888 A178292

Adjacent sequences:  A093213 A093214 A093215 * A093217 A093218 A093219

KEYWORD

base,nonn,less

AUTHOR

Hans Havermann, Mar 28 2004

EXTENSIONS

a(8)-a(10) from John Cerkan, May 22 2017

a(11)-a(14) from John Cerkan, Jan 09 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 January 21 11:00 EST 2019. Contains 319351 sequences. (Running on oeis4.)