Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093283
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093283 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 83. +0
1
0, 83, 2498, 9960, 55527888, 999984, 9999923, 4440400499909009, 444040040777070070, 9999999941 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(5) is 55527888 because its length-5 substrings (55527, 55278, 52788, 27888) are all distinct and divisible by 83 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A068851 A037069 A103233 this_sequence A156924 A084299 A017799

Adjacent sequences: A093280 A093281 A093282 this_sequence A093284 A093285 A093286

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research