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.

A063464 Numbers k such that omega(k) = omega(k+2), where omega(k) is the number of distinct prime divisors of k.

This page as a plain text file.
%I A063464 #23 Dec 02 2023 09:12:50
%S A063464 2,3,5,7,9,10,11,12,17,18,20,22,23,24,25,26,27,29,33,34,36,38,41,44,
%T A063464 46,47,48,50,52,54,55,56,59,63,71,72,74,75,79,80,81,85,86,91,92,93,94,
%U A063464 96,98,101,104,106,107,115,116,117,122,125,130,133,134,137,138,141,142
%N A063464 Numbers k such that omega(k) = omega(k+2), where omega(k) is the number of distinct prime divisors of k.
%H A063464 Amiram Eldar, <a href="/A063464/b063464.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Harry J. Smith)
%t A063464 Select[Range[200],PrimeNu[#]==PrimeNu[#+2]&] (* _Harvey P. Dale_, Jun 20 2011 *)
%o A063464 (PARI) j=[]; for(n=1,350, if(omega(n)==omega(n+2),j=concat(j,n))); j
%o A063464 (PARI) { n=0; for (m=1, 10^9, if (omega(m) == omega(m + 2), write("b063464.txt", n++, " ", m); if (n==1000, break)) ) } \\ _Harry J. Smith_, Aug 22 2009
%Y A063464 Cf. A001221, A006049.
%K A063464 nonn,easy
%O A063464 1,1
%A A063464 _Jason Earls_, Jul 26 2001