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!)
A080768 A unitary phi reciprocal amicable number: consider two different numbers a, b which satisfy the following equation for some integer k: uphi(a)=uphi(b)=1/k*a*b/(a-b); or equivalently, 1/uphi(a)=1/uphi(b)=k*(-1/a+1/b); sequence gives k numbers. 2

%I #4 Apr 19 2016 01:07:33

%S 2,3,14,35,22,3,242,23,253,13,155,12,3,77,5,4,65,860,3,10882,14,91,13,

%T 5,80,543,946,25,1350,13

%N A unitary phi reciprocal amicable number: consider two different numbers a, b which satisfy the following equation for some integer k: uphi(a)=uphi(b)=1/k*a*b/(a-b); or equivalently, 1/uphi(a)=1/uphi(b)=k*(-1/a+1/b); sequence gives k numbers.

%C Here uphi(n)=A047994(n) is the unitary totient function: if n = Product p_i^e_i, uphi(n) = Product (p_i^e_i - 1).

%Y Cf. A047994, A080766, A080767, A067739, A067741.

%K nonn

%O 0,1

%A _Yasutoshi Kohmoto_

%E Kohmoto found 2nd, 6th, 13th, 25th terms. _Dean Hickerson_ calculated the other terms.

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 13 05:24 EDT 2024. Contains 372498 sequences. (Running on oeis4.)