cp's OEIS Frontend

A190251 Positions of 2 in A190248.

%I A190251 #14 Jan 05 2025 19:51:39
%S A190251 3,8,11,16,21,24,29,32,37,42,45,50,53,55,58,63,66,71,76,79,84,87,92,
%T A190251 97,100,105,110,113,118,121,126,131,134,139,142,144,147,152,155,160,
%U A190251 165,168,173,176,181,186,189,194,197,199,202,207,210,215,220,223,228,231,236,241,244,249,254,257,262,265,270,275,278,283,286,288
%N A190251 Positions of 2 in A190248.
%H A190251 G. C. Greubel, <a href="/A190251/b190251.txt">Table of n, a(n) for n = 1..2700</a>
%H A190251 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 A190251 u = GoldenRatio; v = u^2; w=u^3;
%t A190251 f[n_] := Floor[n*u + n*v + n*w] - Floor[n*u] - Floor[n*v] - Floor[n*w]
%t A190251 t = Table[f[n], {n, 1, 120}] (* A190248 *)
%t A190251 Flatten[Position[t, 0]]      (* A190249 *)
%t A190251 Flatten[Position[t, 1]]      (* A190250 *)
%t A190251 Flatten[Position[t, 2]]      (* A190251 *)
%Y A190251 Cf. A190248, A190249, A190250.
%K A190251 nonn
%O A190251 1,1
%A A190251 _Clark Kimberling_, May 06 2011