login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055876 a(n) = round( 1 + e^(n-2) ). 7

%I #12 Dec 02 2023 18:14:11

%S 1,2,4,8,21,56,149,404,1098,2982,8104,22027,59875,162756,442414,

%T 1202605,3269018,8886112,24154954,65659970,178482302,485165196,

%U 1318815735,3584912847,9744803447,26489122131,72004899338,195729609430

%N a(n) = round( 1 + e^(n-2) ).

%C Another increment sequence for Shell short that produces good results (a bit better than A036569).

%H Alois P. Heinz, <a href="/A055876/b055876.txt">Table of n, a(n) for n = 1..1000</a>

%H <a href="/index/So#sorting">Index entries for sequences related to sorting</a>

%t A055876[n_]:=Round[1+E^(n-2)];Array[A055876, 50] (* _Paolo Xausa_, Dec 02 2023 *)

%Y Cf. A003462, A036562, A036569, A055875.

%Y Sequences used for Shell sort: A003462, A033622, A036562, A036564, A036569, A055875, A055876.

%K easy,nonn

%O 1,2

%A Steven Pigeon (pigeon(AT)iro.umontreal.ca), Jul 14 2000

%E More terms from _James A. Sellers_, Aug 22 2000

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)