Numbers n such that phi(n) + d(n) = phi(n+1) + d(n+1), where phi(n) is the Euler totient function of n and d(n) the number of divisors of n.

A259496

Numbers n such that phi(n) + d(n) = phi(n+1) + d(n+1), where phi(n) is the Euler totient function of n and d(n) the number of divisors of n.

Terms

    a(0) =5a(1) =7a(2) =104a(3) =105a(4) =1754a(5) =3255a(6) =16215a(7) =22935a(8) =67431a(9) =93074a(10) =983775a(11) =1025504a(12) =2200694a(13) =2619705a(14) =3365438a(15) =4163355a(16) =4447064a(17) =4695704a(18) =6372794a(19) =7838265a(20) =9718904a(21) =11903775a(22) =23992215a(23) =26879684a(24) =29357475a(25) =37239735a(26) =40588485a(27) =41207144a(28) =48615735a(29) =56424555

External references