Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093263
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093263 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 63. +0
1
0, 63, 7567, 774977, 77742777, 99993699993, 777779177777, 77777784777777, 7777777147777777, 7777777770777777777, 777777777007777777770 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 774977 because its length-4 substrings (7749, 7497, 4977) are all distinct and divisible by 63 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A051589 A069407 A046190 this_sequence A069433 A062208 A132594

Adjacent sequences: A093260 A093261 A093262 this_sequence A093264 A093265 A093266

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