cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A055876 #13 Jul 02 2025 16:02:00
%S A055876 1,2,4,8,21,56,149,404,1098,2982,8104,22027,59875,162756,442414,
%T A055876 1202605,3269018,8886112,24154954,65659970,178482302,485165196,
%U A055876 1318815735,3584912847,9744803447,26489122131,72004899338,195729609430
%N A055876 a(n) = round( 1 + e^(n-2) ).
%C A055876 Another increment sequence for Shell short that produces good results (a bit better than A036569).
%H A055876 Alois P. Heinz, <a href="/A055876/b055876.txt">Table of n, a(n) for n = 1..1000</a>
%H A055876 <a href="/index/So#sorting">Index entries for sequences related to sorting</a>
%t A055876 A055876[n_]:=Round[1+E^(n-2)];Array[A055876, 50] (* _Paolo Xausa_, Dec 02 2023 *)
%Y A055876 Cf. A003462, A036562, A036569, A055875.
%Y A055876 Sequences used for Shell sort: A003462, A033622, A036562, A036564, A036569, A055875, A055876.
%K A055876 easy,nonn
%O A055876 1,2
%A A055876 Steven Pigeon (pigeon(AT)iro.umontreal.ca), Jul 14 2000
%E A055876 More terms from _James Sellers_, Aug 22 2000