cp's OEIS Frontend

A001961 A Beatty sequence: floor(n * (sqrt(5) - 1)).

%I A001961 M0540 N0192 #49 Aug 11 2022 03:36:05
%S A001961 1,2,3,4,6,7,8,9,11,12,13,14,16,17,18,19,21,22,23,24,25,27,28,29,30,
%T A001961 32,33,34,35,37,38,39,40,42,43,44,45,46,48,49,50,51,53,54,55,56,58,59,
%U A001961 60,61,63,64,65,66,67,69,70,71,72,74,75,76,77,79,80,81,82,84
%N A001961 A Beatty sequence: floor(n * (sqrt(5) - 1)).
%C A001961 u-pile positions of the 4-Wythoff game with parameter i=0 (Connell nomenclature). - _R. J. Mathar_, Feb 14 2011
%D A001961 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A001961 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A001961 T. D. Noe, <a href="/A001961/b001961.txt">Table of n, a(n) for n = 1..10000</a>
%H A001961 Ian G. Connell, <a href="http://dx.doi.org/10.4153/CMB-1959-024-3">A generalization of Wythoff's game</a>, Canad. Math. Bull. 2 (1959) 181-190.
%H A001961 A. S. Fraenkel, <a href="http://www.jstor.org/stable/2321643">How to beat your Wythoff games' opponent on three fronts</a>, Amer. Math. Monthly, 89 (1982), 353-361 (the case a=4).
%H A001961 Wen An Liu and Xiao Zhao, <a href="http://dx.doi.org/10.1016/j.dam.2014.08.009">Adjoining to (s,t)-Wythoff's game its P-positions as moves</a>, Discrete Applied Mathematics 179 (2014) 28-43. See Table 1.
%H A001961 N. J. A. Sloane, <a href="/A115004/a115004.txt">Families of Essentially Identical Sequences</a>, Mar 24 2021 (Includes this sequence)
%H A001961 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%F A001961 a(n) = A005206(2*n-1). - _Peter Bala_, Aug 09 2022
%t A001961 Table[Floor[n*(Sqrt[5] - 1)], {n, 100}] (* _T. D. Noe_, Aug 17 2012 *)
%Y A001961 Complement of A001962. Cf. A001965, A005206.
%K A001961 nonn,easy
%O A001961 1,2
%A A001961 _N. J. A. Sloane_
%E A001961 Missing right parenthesis in description corrected May 15 1995