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.

A242034 a(n) = lpf(A243937(n)-3), where lpf = least prime factor (A020639).

This page as a plain text file.
%I A242034 #32 Nov 02 2024 09:14:13
%S A242034 3,5,3,11,3,17,3,3,29,3,5,3,41,3,3,3,59,3,5,3,71,3,7,3,3,3,5,3,101,3,
%T A242034 107,3,3,7,3,5,3,3,137,3,3,149,3,5,3,7,3,3,3,179,3,5,3,191,3,197,3,3,
%U A242034 11,3,5,3,13,3,227,3,3,239,3,5,3,3,3,3,269,3,5,3
%N A242034 a(n) = lpf(A243937(n)-3), where lpf = least prime factor (A020639).
%C A242034 The records of the sequence form sequence of lesser numbers of twin primes.
%C A242034 The sequence contains all odd primes. Cf. comment by _Robert Israel_ in A242033. - _Vladimir Shevelev_, Aug 16 2014
%H A242034 Amiram Eldar, <a href="/A242034/b242034.txt">Table of n, a(n) for n = 1..10000</a>
%t A242034 lpf[n_]:=lpf[n]=First[First[FactorInteger[n]]]; (* least prime factor *)
%t A242034 A242034=Map[lpf[#-3]&,Select[Range[6,300,2],lpf[#-1]>lpf[#-3]&](*A243937*)] (* _Peter J. C. Moses_, Aug 14 2014 *)
%Y A242034 Cf. A001359, A020639, A065091, A242033, A243937, A245024.
%K A242034 nonn
%O A242034 1,1
%A A242034 _Vladimir Shevelev_, Aug 12 2014
%E A242034 More terms from _Peter J. C. Moses_, Aug 12 2014