Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093258
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093258 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 58. +0
1
0, 58, 986, 556844, 881026680, 30803880208220, 9990906888080, 99999946, 999999982, 11110100106666060060 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 556844 because its length-4 substrings (5568, 5684, 6844) are all distinct and divisible by 58 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A141779 A157252 A142966 this_sequence A160347 A017774 A035724

Adjacent sequences: A093255 A093256 A093257 this_sequence A093259 A093260 A093261

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 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research