This site is supported by donations to The OEIS Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036567 Basic numbers used in Sedgewick-Incerpi upper bound for shell sort. 2


%S 3,7,16,41,101,247,613,1529,3821,9539,23843,59611,149015,372539,

%T 931327,2328307,5820767,14551919,36379789,90949471,227373677,

%U 568434193,1421085473,3552713687,8881784201,22204460497,55511151233,138777878081

%N Basic numbers used in Sedgewick-Incerpi upper bound for shell sort.

%D D. E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching, 2nd ed, section 5.2.1, p. 91.

%H 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 <a href="/index/So#sorting">Index entries for sequences related to sorting</a>

%F a(n) is the smallest number >= 2.5^n that is relatively prime to all previous terms in the sequence.

%e 2.5^4 = 39.0625, and 41 is the next integer that is relatively prime to 3, 7 and 16.

%Y Cf. A036569.

%K nonn,easy

%O 1,1

%A _N. J. A. Sloane_

%E Better description and more terms from _Jud McCranie_, Jan 05 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 22 00:32 EST 2019. Contains 329383 sequences. (Running on oeis4.)