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
)
page 1
Search completed in 0.001 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 19:39 EST 2009. Contains 170821 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
