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.

A332799 Numbers whose smallest prime factor is 17.

This page as a plain text file.
%I A332799 #21 Sep 06 2023 13:41:19
%S A332799 17,289,323,391,493,527,629,697,731,799,901,1003,1037,1139,1207,1241,
%T A332799 1343,1411,1513,1649,1717,1751,1819,1853,1921,2159,2227,2329,2363,
%U A332799 2533,2567,2669,2771,2839,2941,3043,3077,3247,3281,3349,3383,3587,3791,3859,3893
%N A332799 Numbers whose smallest prime factor is 17.
%C A332799 The asymptotic density of this sequence is 192/17017. - _Amiram Eldar_, Dec 06 2020
%D A332799 Emmanuel Desurvire, Classical and Quantum Information Theory: An Introduction for the Telecom Scientist, Cambridge University Press, 2009, table 20.5 p. 421.
%H A332799 Amiram Eldar, <a href="/A332799/b332799.txt">Table of n, a(n) for n = 1..10000</a>
%F A332799 a(n) = 17*A008366(n).
%e A332799 a(2) = 17*17, a(3) = 17*19.
%t A332799 17 * Select[Range[230], CoprimeQ[#, 30030] &] (* _Amiram Eldar_, Feb 24 2020 *)
%o A332799 (Rexx)
%o A332799 P = 17         ;  S = P
%o A332799 do N = P by 2 while length( S ) < 255
%o A332799    do I = 1 until P = X
%o A332799       X = PRIME( I )
%o A332799       if P = X       then  leave I
%o A332799       if N // X = 0  then  iterate N
%o A332799    end I
%o A332799    S = S || ',' P*N
%o A332799 end N
%o A332799 say S          ;  return S
%Y A332799 Cf. A084967 (5), A084968 (7), A084969 (11), A084970 (13), A332798 (19), A332797 (23), A008366 (17-rough numbers).
%K A332799 nonn,easy
%O A332799 1,1
%A A332799 _Frank Ellermann_, Feb 24 2020