Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093257
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093257 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 57. +0
1
0, 57, 22855, 775244, 8800855005, 770070110010, 9999966, 99999945, 999999963, 9999999972 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(3) is 22855 because its length-3 substrings (228, 285, 855) are all distinct and divisible by 57 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A127455 A091749 A094777 this_sequence A069255 A065869 A022082

Adjacent sequences: A093254 A093255 A093256 this_sequence A093258 A093259 A093260

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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research