This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A286884 Odd numbers n such that the set of distinct prime divisors of n is equal to the set of distinct prime divisors of sum of proper divisors of n. 0

%I

%S 108927,448335,544635,53781261243,92526188391,612887145325

%N Odd numbers n such that the set of distinct prime divisors of n is equal to the set of distinct prime divisors of sum of proper divisors of n.

%C The first four terms that are divisible by 108927 are 108927, 544635, 92526188391, 4094089374375.

%C a(7) > 10^12. 2981095241355 is also a term. - _Giovanni Resta_, Aug 03 2017

%e 92526188391 is a member because sigma(92526188391) - 92526188391 = 3^2*7*13^3*19*181^2 and 92526188391 = 3^2*7^2*13^2*19^3*181.

%t fQ[n_] := Transpose[ FactorInteger[ n]][[1]] == Transpose[ FactorInteger[ DivisorSigma[1, n] - n]][[1]]; (* _Robert G. Wilson v_, Aug 02 2017 *)

%o (PARI) a001065(n) = if(n==0, 0, sigma(n) - n)

%o a027748(n) = factor(n)[, 1]~

%o is(n) = n%2==1 && a027748(n)==a027748(a001065(n)) \\ _Felix FrÃ¶hlich_, Aug 02 2017

%o (PARI) list(lim)=my(v=List(),f,t,o); forfactored(n=108927,lim\1, f=n[2]; if(f[1,1]==2, next); t=sigma(f)-n[1]; for(i=1,#f~, o=valuation(t,f[i,1]); if(o==0, next(2)); t/=f[i,1]^o); if(t==1, listput(v,n[1]))); Vec(v) \\ _Charles R Greathouse IV_, Aug 02 2017

%Y Cf. A001065, A007947, A027598, A027748, A286876.

%K nonn,more

%O 1,1

%A _Altug Alkan_, Aug 02 2017

%E a(4)-a(6) from _Giovanni Resta_, Aug 03 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 17 21:47 EDT 2019. Contains 324200 sequences. (Running on oeis4.)