Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114922
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A114922
%S A114922 88,999993,88888888,9898654321,999998986863,9999999999924214,
%T A114922 999999999999962944,99999899999899978513,9999999999999999976315,
%U A114922 99899899899899899899899899,9999999999999999999999912715
%N A114922 a(n) is the largest base-10 string such that the n-th number coprime 
               to 10 does not divide any substring of a(n).
%e A114922 a(3) = 999993 (base 10) because the 3th number coprime to 10 is 7; and 
               7 does not divide any substring of a(3).
%Y A114922 Sequence in context: A079036 A159420 A093222 this_sequence A036951 A051328 
               A166321
%Y A114922 Adjacent sequences: A114919 A114920 A114921 this_sequence A114923 A114924 
               A114925
%K A114922 nonn,base
%O A114922 2,1
%A A114922 David W. Wilson (davidwwilson(AT)comcast.net), Feb 17 2006

    
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 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research