login
a(n) = integer nearest e*a(n-1), where a(0) = 1.
5

%I #17 Jan 27 2019 08:49:08

%S 1,3,8,22,60,163,443,1204,3273,8897,24185,65742,178705,485771,1320462,

%T 3589388,9756968,26522189,72094784,195973941,532712403,1448062445,

%U 3936241831,10699814642,29085111709,79061530637,214911522061,584190085145

%N a(n) = integer nearest e*a(n-1), where a(0) = 1.

%H Clark Kimberling, <a href="/A024581/b024581.txt">Table of n, a(n) for n = 0..250</a>

%H Steve Butler, R. L. Graham & Nan Zang, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL11/Butler/butler8.html">Jumping Sequences</a>, Journal of Integer Sequences, Vol. 11, 2008, 08.4.5.

%t a[0] = 1; a[n_] := Round[E*a[n - 1]];

%t Table[a[n], {n, 0, 30}]

%t (* _Clark Kimberling_, Aug 18 2012 *)

%t NestList[Floor[E*#+1/2]&,1,30] (* _Harvey P. Dale_, Jan 10 2013 *)

%o (PARI) lista(nn) = {nn++; my(va = vector(nn)); va[1] = 1; for (n=2, nn, va[n] = round(exp(1)*va[n-1]);); va;} \\ _Michel Marcus_, Jan 27 2019

%Y Equals row sums of triangle A153583. [_Gary W. Adamson_, Dec 28 2008]

%K nonn

%O 0,2

%A _Clark Kimberling_