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!)
A024576 a(n) = [ e*a(n-1) ], where a(0) = 1. 2

%I #10 Aug 03 2014 14:27:15

%S 1,2,5,13,35,95,258,701,1905,5178,14075,38259,103998,282695,768444,

%T 2088847,5678074,15434605,41955606,114047161,310012325,842700869,

%U 2290698459,6226763995,16926099417,46009908471,125067898125,339969794796,924133715418

%N a(n) = [ e*a(n-1) ], where a(0) = 1.

%H Clark Kimberling, <a href="/A024576/b024576.txt">Table of n, a(n) for n = 0..249</a>

%t a[0] = 1; a[n_] := Floor[E*a[n-1]]; Table[a[n], {n, 50}] (* _Clark Kimberling_, Aug 17 2012 *)

%t NestList[Floor[E*#]&,1,30] (* _Harvey P. Dale_, Apr 24 2014 *)

%K nonn

%O 0,2

%A _Clark Kimberling_

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 March 28 17:42 EDT 2024. Contains 371254 sequences. (Running on oeis4.)