Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093259
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093259 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 59. +0
1
0, 59, 944, 9971, 99946, 771071449049, 444022266603339990, 8888444422221111, 222222202555555505, 55555550507777777070 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(6) is 771071449049 because its length-6 substrings (771071, 710714, 107144, 071449, 714490, 144904, 449049) are all distinct and divisible by 59 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A125034 A140024 A142363 this_sequence A134652 A017775 A017722

Adjacent sequences: A093256 A093257 A093258 this_sequence A093260 A093261 A093262

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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research