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
%I A093263
%S A093263 0,63,7567,774977,77742777,99993699993,777779177777,77777784777777,
%T A093263 7777777147777777,7777777770777777777,777777777007777777770
%N A093263 a(n) is the largest number such that all of a(n)'s length-n substrings 
               are distinct and divisible by 63.
%H A093263 Hans Havermann, <a href="a093211.txt">Table of A093211-A093299</a>
%e A093263 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
%Y A093263 Cf. A093211, A093212, ..., A093299.
%Y A093263 Sequence in context: A051589 A069407 A046190 this_sequence A069433 A062208 
               A132594
%Y A093263 Adjacent sequences: A093260 A093261 A093262 this_sequence A093264 A093265 
               A093266
%K A093263 base,nonn
%O A093263 1,2
%A A093263 Hans Havermann (pxp(AT)rogers.com), Mar 29 2004

    
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 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research