OFFSET
1,2
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..1166 (terms below 10^13, calculated from the b-file at A001274)
Daeyeoul Kim, Umit Sarp, and Sebahattin Ikikardes, Certain combinatoric convolution sums arising from Bernoulli and Euler Polynomials, Miskolc Mathematical Notes, No. 20, Vol. 1 (2019): pp. 311-330.
EXAMPLE
1 is a term since 1 and 2 are both squarefree and phi(1) = phi(2) = 1.
MATHEMATICA
s = {}; p1 = 1; Do[p2 = If[SquareFreeQ[n], EulerPhi[n], 0]; If[p2 > 0 && p2 == p1, AppendTo[s, n-1]]; p1 = p2, {n, 2, 10^5}]; s
PROG
(PARI) for(k=1, 10^7, if(issquarefree(k), if(issquarefree(k+1), if(eulerphi(k)==eulerphi(k+1), print1(k, ", "))))) \\ Hugo Pfoertner, Apr 08 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
Amiram Eldar, Apr 08 2020
STATUS
approved