The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A033320 a(n) = floor( sqrt(2) * (3/2)^n ). 1

%I

%S 1,2,3,4,7,10,16,24,36,54,81,122,183,275,412,619,928,1393,2090,3135,

%T 4702,7053,10580,15871,23807,35710,53565,80348,120523,180784,271176,

%U 406765,610148,915222,1372833,2059249,3088874,4633312,6949968,10424952,15637429

%N a(n) = floor( sqrt(2) * (3/2)^n ).

%C Suggested by the Mahler paper.

%H G. C. Greubel, <a href="/A033320/b033320.txt">Table of n, a(n) for n = 0..1000</a>

%H K. Mahler, <a href="https://doi.org/10.1017/S1446788700005371">An unsolved problem on the powers of 3/2</a>, J. Austral. Math. Soc. 8 (1968), pp. 313-321.

%t Table[Floor[Sqrt[2]*(3/2)^n], {n,0,50}] (* _G. C. Greubel_, Sep 30 2018 *)

%o (PARI) vector(50, n, n--; floor(sqrt(2)*(3/2)^n)) \\ _G. C. Greubel_, Sep 30 2018

%o (MAGMA) [Floor(Sqrt(2)*(3/2)^n) : n in [0..50]]; // _G. C. Greubel_, Sep 30 2018

%K nonn

%O 0,2

%A _N. J. A. Sloane_, Apr 18 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 23 10:36 EST 2020. Contains 331171 sequences. (Running on oeis4.)