Search: id:A036567
Results 1-1 of 1 results found.

%I A036567
%S A036567 3,7,16,41,101,247,613,1529,3821,9539,23843,59611,149015,372539,931327,
%T A036567 2328307,5820767,14551919,36379789,90949471,227373677,568434193,
%U A036567 1421085473,3552713687,8881784201,22204460497,55511151233,138777878081
%N A036567 Basic numbers used in Sedgewick-Incerpi upper bound for shell sort.
%D A036567 D. E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching, 
               2nd ed, section 5.2.1, pg 91.
%H A036567 Robert Sedgewick, <a href="http://www.cs.princeton.edu/~rs/talks/shellsort.ps">
               Analysis of shellsort and related algorithms</a>, Fourth European 
               Symposium on Algorithms, Barcelona, September, 1996.
%H A036567 <a href="Sindx_So.html#sorting">Index entries for sequences related to 
               sorting</a>
%F A036567 a(n) is the smallest number >= 2.5^n that is relatively prime to all 
               previous terms in the sequence.
%e A036567 2.5^4=39.0625, 41 is the next integer that is relatively prime to 3, 
               7 and 16.
%Y A036567 Cf. A036569.
%Y A036567 Sequence in context: A001698 A029761 A009337 this_sequence A018023 A144977 
               A058300
%Y A036567 Adjacent sequences: A036564 A036565 A036566 this_sequence A036568 A036569 
               A036570
%K A036567 nonn,easy
%O A036567 1,1
%A A036567 N. J. A. Sloane (njas(AT)research.att.com).
%E A036567 Better description and more terms from Jud McCranie (j.mccranie(AT)comcast.net), 
               Jan 05 2001

Search completed in 0.001 seconds