cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A190249 Positions of 0 in A190248.

This page as a plain text file.
%I A190249 #14 Jan 05 2025 19:51:39
%S A190249 2,5,10,13,18,23,26,31,34,36,39,44,47,52,57,60,65,68,73,78,81,86,89,
%T A190249 91,94,99,102,107,112,115,120,123,128,133,136,141,146,149,154,157,162,
%U A190249 167,170,175,178,180,183,188,191,196,201,204,209,212,217,222,225,230,233,235,238,243,246,251,256,259,264,267,272,277,280,285,290
%N A190249 Positions of 0 in A190248.
%H A190249 G. C. Greubel, <a href="/A190249/b190249.txt">Table of n, a(n) for n = 1..2700</a>
%H A190249 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 A190249 u = GoldenRatio; v = u^2; w=u^3;
%t A190249 f[n_] := Floor[n*u + n*v + n*w] - Floor[n*u] - Floor[n*v] - Floor[n*w]
%t A190249 t = Table[f[n], {n, 1, 120}] (* A190248 *)
%t A190249 Flatten[Position[t, 0]]      (* A190249 *)
%t A190249 Flatten[Position[t, 1]]      (* A190250 *)
%t A190249 Flatten[Position[t, 2]]      (* A190251 *)
%Y A190249 Cf. A190248, A190250, A190251.
%K A190249 nonn
%O A190249 1,1
%A A190249 _Clark Kimberling_, May 06 2011