|
%I #19 Feb 19 2019 03:50:40
%S 17,34,51,68,89,106,123,140,161,178,195,212,233,250,267,284,305,322,
%T 339,356,373,394,411,428,445,466,483,500,517,538,555,572,589,610,627,
%U 644,661,678,699,716,733,750,771,788,805,822,843,860,877,894,915,932,949,966,983,1004,1021,1038,1055
%N Positions of 0 in the zero-one sequence [nr+4r]-[nr]-[4r], where r=sqrt(5) and []=floor.
%C See A187950.
%H Chai Wah Wu, <a href="/A188290/b188290.txt">Table of n, a(n) for n = 1..10000</a>
%p r := sqrt(5) ;
%p for n from 1 to 1200 do
%p a := floor((n+4)*r)-floor(n*r)-floor(4*r) ;
%p if a = 0 then
%p printf("%d,",n);
%p end if;
%p end do: # _R. J. Mathar_, Jun 03 2011
%t Flatten[Position[Table[Floor[(n+4)Sqrt[5]]-Floor[n*Sqrt[5]]-Floor[ 4*Sqrt[5]], {n,1100}],0]] (* _Harvey P. Dale_, Sep 23 2014 *)
%o (Python)
%o from gmpy2 import isqrt
%o A188290_list = [n for n in range(1,10**6) if isqrt(5*(n+4)**2) - isqrt(5*n**2) == 8] # _Chai Wah Wu_, Oct 08 2016
%Y Cf. A187950.
%K nonn,easy
%O 1,1
%A _Clark Kimberling_, Mar 26 2011
%E All values corrected by _R. J. Mathar_, Jun 03 2011
|
