The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A301868 Numbers k such that phi(k, 2) = phi(k+1, 2), where phi(k, 2) = A002472(k). 1
1, 2, 9, 34, 50, 153, 274, 321, 2841, 4610, 7474, 8254, 10250, 13430, 22149, 38961, 51981, 86845, 91310, 198057, 237325, 367629, 374541, 394834, 419169, 489445, 513890, 516350, 519230, 570230, 717969, 1308609, 1523630, 1557909, 1753730, 1935362, 2109969, 3005409 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Henry L. Alder, A Generalization of the Euler phi-Function, The American Mathematical Monthly, Vol. 65, No. 9 (Nov., 1958), pp. 690-692.
EXAMPLE
phi(9, 2) = phi(10, 2) = 3, thus 9 is in the sequence.
MATHEMATICA
seq = {}; a[n_] := If[Head[r = Reduce[GCD[x, n] == 1 && GCD[x + 2, n] == 1 && 1 <= x <= n, x, Integers]] === Or, Length[r], 1]; a0 = a[1]; Do[
a1 = a[k + 1]; If[a1 == a0, AppendTo[seq, k]]; a0 = a1, {k, 1, 1000}]; seq (* after Jean-François Alcover at A002472 *)
PROG
(PARI) f(n) = sum(x=1, n, (gcd(n, x) == 1) && (gcd(n, x+2) == 1));
isok(n) = f(n) == f(n+1); \\ Michel Marcus, Apr 09 2018
CROSSREFS
Cf. A002472.
Sequence in context: A109719 A263685 A334443 * A288958 A212348 A000524
KEYWORD
nonn
AUTHOR
Amiram Eldar, Mar 28 2018
EXTENSIONS
a(20)-a(29) from Robert Price, May 18 2018
More terms from Amiram Eldar, Mar 26 2023
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 09:51 EDT 2024. Contains 372910 sequences. (Running on oeis4.)