A266276 a(n) is the smallest number k such that phi(k) = n*phi(k-1).

2, 3, 7, 1261, 11242771

Offset

1,1

Links

Table of n, a(n) for n=1..5.

Example

a(3) = 7 because 7 is the smallest number k such that phi(k) = n*phi(k-1); phi(7) = 6 =3*phi(6) = 3*2.

Prog

(Magma) a:=func<n|exists(r){k:k in[2..10^8] | EulerPhi(k) eq n*EulerPhi(k-1)}select r else 0>; [a(n):n in[1..5]]
(PARI) a(n) = my(k=2, epk=1, enk); while ((enk=eulerphi(k)) != n*epk, epk = enk; k++); k; \\ Michel Marcus, Feb 20 2020

Crossrefs

Sequences of numbers n such that phi(n) = k*phi(n-1) for k = 1, 2, 3, 4, 5: {A001274 + 1} for k=1; A171271 = {A050472 + 1} for k=2; A266268 = {A067143 + 1} for k=3; A268126 = {A172314 + 1} for k=4; {A201253 + 1} for k=5.

Cf. A000010 (phi(n)), A266269 (the smallest numbers k such that phi(k) >= n*phi(k-1)).

Sequence in context: A077524 A069503 A238400 * A088252 A334021 A196303

Adjacent sequences: A266273 A266274 A266275 * A266277 A266278 A266279

Keyword

nonn,more

Author

Jaroslav Krizek, Jan 26 2016

Status

approved