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!)
A082056 Least x = a(n) such that sum of common prime divisors (without multiplicity) of sigma(x) and phi(x) equals n, or 0 if such number (apparently) does not exist. 2
0, 3, 18, 0, 14, 0, 88, 1800, 116, 196, 9801, 377, 2881, 1189, 711, 989, 3596, 477, 6901, 5203, 8473, 9179, 3956, 7067, 6439, 27709, 41309, 10763, 27117, 20569, 10207, 69091, 4976, 15376, 114953, 18650, 204469, 37225, 16279, 130300, 74450, 10877 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A solution is not possible for a(1), a(4) and a(6). - Donovan Johnson, Feb 28 2013
LINKS
MATHEMATICA
ffi[x_] := Flatten[FactorInteger[x]] lf[x_] := Length[FactorInteger[x]] ba[x_] := Table[Part[ffi[x], 2*w-1], {w, 1, lf[x]}] t=Table[0, {100}]; Do[s=Apply[Plus, Intersection [ba[EulerPhi[n]], ba[DivisorSigma[1, n]]]]; If[s<101&&t[[s]]\[Equal]0, t[[s]]=n], {n, 2, 1000000}]; t
CROSSREFS
Sequence in context: A162713 A161473 A208493 * A082057 A161687 A245498
KEYWORD
nonn
AUTHOR
Labos Elemer, Apr 03 2003
STATUS
approved

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 June 4 19:35 EDT 2024. Contains 373102 sequences. (Running on oeis4.)