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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049472 a(n) = floor(n/sqrt(2)). 19

%I

%S 0,0,1,2,2,3,4,4,5,6,7,7,8,9,9,10,11,12,12,13,14,14,15,16,16,17,18,19,

%T 19,20,21,21,22,23,24,24,25,26,26,27,28,28,29,30,31,31,32,33,33,34,35,

%U 36,36,37,38,38,39,40,41,41,42,43,43,44,45,45,46,47

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

%C For n > 0: A006337(n) = number of repeating n's. - _Reinhard Zumkeller_, Jul 04 2015

%H Vincenzo Librandi, <a href="/A049472/b049472.txt">Table of n, a(n) for n = 0..10000</a>

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

%p A049472:=n->floor(n/sqrt(2)): seq(A049472(n), n=0..100); # _Wesley Ivan Hurt_, Jun 25 2016

%t Floor[Range[0,70]/Sqrt[2]] (* _Harvey P. Dale_, Aug 22 2011 *)

%o (MAGMA) [Floor(n/Sqrt(2)): n in [0..70] ]; // _Vincenzo Librandi_, Aug 23 2011

%o (Haskell)

%o a049472 = floor . (/ sqrt 2) . fromIntegral

%o -- _Reinhard Zumkeller_, Jul 04 2015

%o (PARI) a(n)=sqrtint(n^2\2) \\ _Charles R Greathouse IV_, Sep 02 2015

%Y First differences give A080764.

%Y Cf. A006337, A049474.

%K nonn,easy

%O 0,4

%A _Thomas Kellar_

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 19 02:43 EDT 2021. Contains 345125 sequences. (Running on oeis4.)