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!)
A022842 Beatty sequence for sqrt(8). 21

%I #30 Sep 08 2022 08:44:46

%S 2,5,8,11,14,16,19,22,25,28,31,33,36,39,42,45,48,50,53,56,59,62,65,67,

%T 70,73,76,79,82,84,87,90,93,96,98,101,104,107,110,113,115,118,121,124,

%U 127,130,132,135,138,141,144,147,149,152,155,158,161,164

%N Beatty sequence for sqrt(8).

%H Vincenzo Librandi, <a href="/A022842/b022842.txt">Table of n, a(n) for n = 1..10000</a>

%H N. J. A. Sloane, <a href="/A115004/a115004.txt">Families of Essentially Identical Sequences</a>, Mar 24 2021 (Includes this sequence)

%H <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>

%F a(n) = floor(2*n*sqrt(2)). - _Michel Marcus_, Oct 31 2017

%p a:=n->floor(2*n*sqrt(2)): seq(a(n),n=1..60); # _Muniru A Asiru_, Sep 28 2018

%t Table[Floor[2*n*Sqrt[2]], {n,1,60}] (* _G. C. Greubel_, Sep 28 2018 *)

%o (Magma) [Floor(n*Sqrt(8)): n in [1..60]]; // _Vincenzo Librandi_, Oct 24 2011

%o (PARI) vector(80, n, floor(2*n*sqrt(2))) \\ _G. C. Greubel_, Sep 28 2018

%o (Python)

%o from sympy import integer_nthroot

%o def A022842(n): return integer_nthroot(8*n**2,2)[0] # _Chai Wah Wu_, Mar 16 2021

%Y A bisection of A001951. Cf. A010466.

%K nonn,easy

%O 1,1

%A _Clark Kimberling_

%E Offset changed from 0 to 1 by _Vincenzo Librandi_, Oct 24 2011

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 29 07:27 EDT 2024. Contains 371265 sequences. (Running on oeis4.)