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.

A082049 Least composite number greater than n-th composite number having greater smallest prime factor than that of n-th composite number.

This page as a plain text file.
%I A082049 #10 Mar 26 2025 08:28:23
%S A082049 9,9,9,25,15,15,15,25,21,21,21,25,25,25,49,27,35,33,33,33,35,35,49,39,
%T A082049 39,49,45,45,45,49,49,49,121,51,55,55,55,77,57,65,63,63,63,65,65,77,
%U A082049 69,69,77,75,75,75,77,77,121,81,81,85,85,85,91,87,91,91,91,121,93,95,95
%N A082049 Least composite number greater than n-th composite number having greater smallest prime factor than that of n-th composite number.
%H A082049 Amiram Eldar, <a href="/A082049/b082049.txt">Table of n, a(n) for n = 1..10000</a>
%F A082049 A020639(a(n)) > A020639(A002808(n)).
%F A082049 A082048(A002808(n)) <= a(n).
%t A082049 seq[lim_] := Module[{c = Select[Range[lim], CompositeQ], p, s = {}, n, v}, p = FactorInteger[#][[1, 1]] & /@ c; n = Length[p]; Do[v = 0; Do[If[p[[j]] > p[[i]], v = c[[j]]; Break[]], {j, i + 1, n}]; If[v == 0, Break[], AppendTo[s, v]], {i, 1, n}]; s]; seq[125] (* _Amiram Eldar_, Mar 26 2025 *)
%Y A082049 Cf. A002808, A020639, A056608.
%K A082049 nonn
%O A082049 1,1
%A A082049 _Reinhard Zumkeller_, Apr 02 2003