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

A066219

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

Terms

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

External references