cp's OEIS Frontend

A190250 Positions of 1 in A190248.

%I A190250 #26 Jan 05 2025 19:51:39
%S A190250 1,4,6,7,9,12,14,15,17,19,20,22,25,27,28,30,33,35,38,40,41,43,46,48,
%T A190250 49,51,54,56,59,61,62,64,67,69,70,72,74,75,77,80,82,83,85,88,90,93,95,
%U A190250 96,98,101,103,104,106,108,109,111,114,116,117,119,122,124,125,127,129,130,132,135,137,138,140,143,145,148,150,151,153,156,158,159,161
%N A190250 Positions of 1 in A190248.
%C A190250 Numbers n such that 1/4 < {n*phi} < 3/4, where phi is the golden ratio (1+sqrt(5))/2 and { } denotes fractional part. - _Burghard Herrmann_, Nov 14 2017
%H A190250 G. C. Greubel, <a href="/A190250/b190250.txt">Table of n, a(n) for n = 1..5500</a>
%H A190250 Burghard Herrmann, <a href="/A190250/a190250.pdf">Characterization of some golden ratio sequences</a>
%H A190250 Burghard Herrmann, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Papers1/57-5/herrmann.pdf">How integer sequences find their way into areas outside pure mathematics</a>, The Fibonacci Quarterly (2019) Vol. 57, No. 5, 67-71.
%t A190250 u = GoldenRatio; v = u^2; w=u^3;
%t A190250 f[n_] := Floor[n*u + n*v + n*w] - Floor[n*u] - Floor[n*v] - Floor[n*w]
%t A190250 t = Table[f[n], {n, 1, 120}] (* A190248 *)
%t A190250 Flatten[Position[t, 0]]      (* A190249 *)
%t A190250 Flatten[Position[t, 1]]      (* A190250 *)
%t A190250 Flatten[Position[t, 2]]      (* A190251 *)
%o A190250 (PARI) isok(n) = my(u=(1+sqrt(5))/2); floor(2*n+4*n*u)-floor(n*u)-floor(n+n*u)-floor(n+2*n*u) == 1; \\ _Michel Marcus_, Nov 14 2017
%Y A190250 Cf. A190248, A190249, A190251.
%K A190250 nonn
%O A190250 1,2
%A A190250 _Clark Kimberling_, May 06 2011