Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093247
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093247 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 47. +0
1
0, 947, 4705, 80846063, 99969, 772727889898, 9999955, 222200027777000711110001, 999999965, 99999999791111111161 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 80846063 because its length-4 substrings (8084, 0846, 8460, 4606, 6063) are all distinct and divisible by 47, and there is no larger number with this property

CROSSREFS

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

Sequence in context: A112491 A133353 A119240 this_sequence A020366 A108896 A096954

Adjacent sequences: A093244 A093245 A093246 this_sequence A093248 A093249 A093250

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research