Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093284
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093284 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 84. +0
1
0, 84, 924, 21008400, 99960, 88880488880, 50505008080800, 99999984, 999999924, 22222221008888888400 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 21008400 because its length-4 substrings (2100, 1008, 0084, 0840, 8400) are all distinct and divisible by 84, and there is no larger number with this property

CROSSREFS

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

Sequence in context: A064198 A008429 A069080 this_sequence A027794 A027821 A092719

Adjacent sequences: A093281 A093282 A093283 this_sequence A093285 A093286 A093287

KEYWORD

base,nonn

AUTHOR

Hans Havermann (pxp(AT)rogers.com), Mar 29 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research