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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A063457 a(n) = floor(a(n-1)*(Pi-1)); a(1) = 1. 2

%I #14 Jun 26 2018 05:01:07

%S 1,2,4,8,17,36,77,164,351,751,1608,3443,7373,15789,33813,72413,155079,

%T 332116,711257,1523222,3262121,6986134,14961453,32041337,68619491,

%U 146954997,314717741,673997202,1443427456,3091233635,6620163243

%N a(n) = floor(a(n-1)*(Pi-1)); a(1) = 1.

%H Harry J. Smith, <a href="/A063457/b063457.txt">Table of n, a(n) for n = 1..300</a>

%t a[1] = 1; a[n_] = Floor[ a[n - 1]*(Pi - 1) ]; Table[ a[n], {n, 1, 35} ]

%t With[{c=Pi-1},NestList[Floor[c #]&,1,40]] (* _Harvey P. Dale_, Jan 14 2012 *)

%o (PARI) { default(realprecision, 100); for (n=1, 300, if (n>1, a=floor(a*(Pi - 1)), a=1); write("b063457.txt", n, " ", a) ) } \\ _Harry J. Smith_, Aug 22 2009

%Y Cf. A063458.

%K nonn

%O 1,2

%A _Robert G. Wilson v_, Jul 25 2001

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.

Last modified September 23 03:16 EDT 2023. Contains 365532 sequences. (Running on oeis4.)