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.

A076137 Numbers k such that Omega(k) = Omega(k-1) + Omega(k-2) + Omega(k-3), where Omega(n) denotes the number of prime factors of n, with multiplicity.

This page as a plain text file.
%I A076137 #9 Apr 26 2021 21:06:30
%S A076137 4,32,64,96,144,180,216,224,240,360,400,432,576,600,648,672,800,972,
%T A076137 1008,1040,1088,1104,1188,1232,1260,1344,1400,1404,1408,1456,1500,
%U A076137 1584,1620,1624,1680,1700,1764,1800,1840,1880,1904,1920,1980,2000,2040,2064
%N A076137 Numbers k such that Omega(k) = Omega(k-1) + Omega(k-2) + Omega(k-3), where Omega(n) denotes the number of prime factors of n, with multiplicity.
%H A076137 Harvey P. Dale, <a href="/A076137/b076137.txt">Table of n, a(n) for n = 1..1000</a>
%e A076137 a(3) = 64 is a term because Omega(64) = 6 = Omega(63)+Omega(62)+Omega(61) = 3+2+1 = 6.
%t A076137 l = {4}; Do[If[Omega[n] == Omega[n - 1] + Omega[n - 2] + Omega[n - 3], l = Append[l, n]], {n, 5, 5000}]; l
%t A076137 Transpose[Select[Partition[Range[2100],4,1],PrimeOmega[Last[#]] == Total[ PrimeOmega[Take[#,3]]]&]][[4]] (* _Harvey P. Dale_, Nov 29 2011 *)
%Y A076137 Cf. A076136, A001222.
%K A076137 nonn
%O A076137 1,1
%A A076137 _Joseph L. Pe_, Oct 30 2002