Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093242
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093242 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 42. +0
1
0, 842, 50420, 21008400, 99960, 88884688884, 99999906666660, 8888880022222200, 555555000222222000, 22222221008888888400 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(3) is 50420 because its length-3 substrings (504, 042, 420) are all distinct and divisible by 42 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A031736 A031617 A154473 this_sequence A031527 A045243 A096025

Adjacent sequences: A093239 A093240 A093241 this_sequence A093243 A093244 A093245

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 November 25 13:47 EST 2009. Contains 167481 sequences.


AT&T Labs Research