login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093263 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 63. 0
0, 63, 7567, 774977, 77742777, 99993699993, 777779177777, 77777784777777, 7777777147777777, 7777777770777777777, 777777777007777777770 (list; graph; refs; listen; history; internal format)
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: A195620 A069407 A046190 * A069433 A178634 A174763

Adjacent sequences:  A093260 A093261 A093262 * A093264 A093265 A093266

KEYWORD

base,nonn

AUTHOR

Hans Havermann (gladhobo(AT)teksavvy.com), Mar 29 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 08:49 EST 2012. Contains 205614 sequences.