%I #55 Aug 17 2022 22:19:09
%S 0,4,8,12,16,21,25,29,33,38,42,46,50,55,59,63,67,72,76,80,84,88,93,97,
%T 101,105,110,114,118,122,127,131,135,139,144,148,152,156,160,165,169,
%U 173,177,182,186,190,194,199
%N a(n) = floor(n*phi^3), where phi=(1+sqrt(5))/2.
%C For n>=1, a(n) is the position of the n-th 1 in the zero-one sequence [nr+r]-[nr]-[r], where r=sqrt(5); see A188221. Also, A004976=-1+A004958 (for n>=1), and A004976 is the complement of A188222. [_Clark Kimberling_, Mar 24 2011]
%H Vincenzo Librandi, <a href="/A004976/b004976.txt">Table of n, a(n) for n = 0..1000</a>
%H A. J. Hildebrand, Junxian Li, Xiaomin Li, and Yun Xie, <a href="https://arxiv.org/abs/1809.08690">Almost Beatty Partitions</a>, arXiv:1809.08690 [math.NT], 2018.
%H Vincent Russo and Loren Schwiebert, <a href="https://www.fq.math.ca/Papers1/49-2/RussoSchwiebert.pdf">Beatty Sequences, Fibonacci Numbers, and the Golden Ratio</a>, The Fibonacci Quarterly, Vol 49, Number 2, May 2011.
%H <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%F a(n) = n+floor(2*n*phi). [Formula corrected by _Clark Kimberling_, Mar 22 2008]
%t r=5^(1/2); k=1;
%t t=Table[Floor[n*r+k*r]-Floor[n*r]-Floor[k*r], {n,1,220}] (* A188221 *)
%t Flatten[Position[t,0] ] (* A188222 *)
%t Flatten[Position[t,1] ] (* A004976 *)
%t (* _Clark Kimberling_, Mar 24 2011] *)
%t With[{c=GoldenRatio^3},Floor[c*Range[0,50]] (* _Vincenzo Librandi_, Apr 12 2012 *)
%o (PARI) a(n)=2*n+sqrtint(5*n^2) \\ _Charles R Greathouse IV_, Apr 12 2012
%o (Python)
%o from math import isqrt
%o def A004976(n): return (isqrt(20*n**2)>>1)+(n<<1) # _Chai Wah Wu_, Aug 17 2022
%Y Cf. A000201, A001950, A004919, A004958, A188221, A188222.
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_