Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093216
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093216 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 16. +0
1
0, 964800, 99288000, 99840000, 9998400000, 999984000000, 99999840000000 (list; graph; listen)
OFFSET

1,2

LINKS

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 this_sequence A121888 A083395 A106782

Adjacent sequences: A093213 A093214 A093215 this_sequence A093217 A093218 A093219

KEYWORD

base,nonn

AUTHOR

Hans Havermann (pxp(AT)rogers.com), Mar 28 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research