The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A076778 3-nadirs of Omega: numbers k such that Omega(k-3) > Omega(k-2) > Omega(k-1) > Omega(k) < Omega(k+1) < Omega(k+2) < Omega(k+3), where Omega(k) = number of prime factors of k, counting multiplicity. 1
 40147, 126173, 168907, 230947, 255427, 322627, 383133, 393027, 393773, 415677, 450173, 466827, 495123, 502973, 579533, 661747, 692547, 745747, 757227, 777773, 803157, 816573, 824947, 846173, 863453, 902333, 919389, 942653, 946013, 959213 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS I call n a "k-nadir" (or nadir of depth k) of the arithmetical function f if n satisfies f(n-k) > ... > f(n-1) > f(n) < f(n+1) < ... < f(n+k). LINKS Amiram Eldar, Table of n, a(n) for n = 1..10000 MATHEMATICA Omega[n_] := Apply[Plus, Transpose[FactorInteger[n]][[2]]]; Select[Range[5, 10^6], Omega[ # - 3] > Omega[ # - 2] > Omega[ # - 1] > Omega[ # ] < Omega[ # + 1] < Omega[ # + 2] < Omega[ # + 3] &] PROG (Magma) f:=func; f1:=func; f2:=func; [k:k in [5..960000]| f1(k) and f2(k)]; // Marius A. Burtea, Feb 19 2020 CROSSREFS Cf. A001222. Sequence in context: A250079 A237238 A236253 * A172863 A159720 A127228 Adjacent sequences: A076775 A076776 A076777 * A076779 A076780 A076781 KEYWORD nonn AUTHOR Joseph L. Pe, Nov 14 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 10 22:20 EST 2023. Contains 367717 sequences. (Running on oeis4.)