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!)
A001698 a(n) = ceiling(sqrt( 2*Pi )^n). 3

%I #16 Dec 19 2016 01:21:32

%S 1,3,7,16,40,99,249,622,1559,3907,9793,24547,61529,154231,386598,

%T 969057,2429064,6088761,15262259,38256810,95895601,240374624,

%U 602529829,1510318306,3785806568,9489609785,23786924201,59624976769,149457652642,374634777973

%N a(n) = ceiling(sqrt( 2*Pi )^n).

%H T. D. Noe, <a href="/A001698/b001698.txt">Table of n, a(n) for n = 0..500</a>

%t Table[Ceiling[Sqrt[2Pi]^n], {n, 0, 50}] (* _Stefan Steinerberger_, Apr 14 2006 *)

%K nonn

%O 0,2

%A _N. J. A. Sloane_

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 16 05:35 EDT 2024. Contains 371697 sequences. (Running on oeis4.)