This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A036564 a(n) = 2^n - 45 with n>5, a(5)=1. 9
 1, 19, 83, 211, 467, 979, 2003, 4051, 8147, 16339, 32723, 65491, 131027, 262099, 524243, 1048531, 2097107, 4194259, 8388563, 16777171, 33554387, 67108819, 134217683, 268435411, 536870867, 1073741779, 2147483603, 4294967251 (list; graph; refs; listen; history; text; internal format)
 OFFSET 5,2 LINKS Vincenzo Librandi, Table of n, a(n) for n = 5..1000 Robert Sedgewick, Analysis of shellsort and related algorithms, Fourth European Symposium on Algorithms, Barcelona, September, 1996. Index entries for linear recurrences with constant coefficients, signature (3,-2). FORMULA G.f.: x^5*(1+2*x)*(1+14*x)/((1-x)*(1-2*x)). [Colin Barker, Mar 09 2012] PROG (PARI) a(n)=if(n>5, 2^n-45, 1) \\ Charles R Greathouse IV, Mar 10, 2012 CROSSREFS Sequences used for Shell sort: A003462, A033622, A036562, A036564, A036569, A055875. Sequence in context: A044587 A142042 A142934 * A062639 A209369 A288749 Adjacent sequences:  A036561 A036562 A036563 * A036565 A036566 A036567 KEYWORD nonn,easy AUTHOR 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 17 08:42 EDT 2019. Contains 325098 sequences. (Running on oeis4.)