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).
If just phi(n-1) > phi(n) < phi(n+1) is required for odd n, does this lead to a different sequence? That is, are there consecutive odd numbers in A161962 or consecutive even numbers in A161963? - Jianing Song, Jan 12 2019
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..5000 from G. C. Greubel)
EXAMPLE
phi(313), ..., phi(317) equal 312, 156, 144, 156, 316, respectively, so 315 is a 2-nadir of phi(n).
MATHEMATICA
Select[Range[3, 10^4], EulerPhi[#-2] > EulerPhi[#-1] > EulerPhi[#] < EulerPhi[#+1] < EulerPhi[#+2] &]
PROG
(SageMath) [n for n in (3..9000) if euler_phi(n-2) > euler_phi(n-1) > euler_phi(n) < euler_phi(n+1) < euler_phi(n+2)] # G. C. Greubel, Feb 27 2019
(Magma) eu:=EulerPhi; f:=func<n|eu(n) lt eu(n+1) and eu(n+1) lt eu(n+2)>; f1:= func<n|eu(n) lt eu(n-1) and eu(n-1) lt eu(n-2)>; [k:k in [3..8100]|f(k) and f1(k)]; // Marius A. Burtea, Feb 19 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
Joseph L. Pe, Nov 14 2002
STATUS
approved
