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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036567 Basic numbers used in Sedgewick-Incerpi upper bound for shell sort. 2
3, 7, 16, 41, 101, 247, 613, 1529, 3821, 9539, 23843, 59611, 149015, 372539, 931327, 2328307, 5820767, 14551919, 36379789, 90949471, 227373677, 568434193, 1421085473, 3552713687, 8881784201, 22204460497, 55511151233, 138777878081 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

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

LINKS

Table of n, a(n) for n=1..28.

Robert Sedgewick, Analysis of shellsort and related algorithms, Fourth European Symposium on Algorithms, Barcelona, September, 1996.

Index entries for sequences related to sorting

FORMULA

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

EXAMPLE

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

CROSSREFS

Cf. A036569.

Sequence in context: A261236 A029761 A009337 * A018023 A144977 A058300

Adjacent sequences:  A036564 A036565 A036566 * A036568 A036569 A036570

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane

EXTENSIONS

Better description and more terms from Jud McCranie, Jan 05 2001

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified March 27 08:27 EDT 2017. Contains 284146 sequences.