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!)
A306870 Lesser of reduced bi-unitary amicable pair. 2

%I #17 Mar 16 2019 17:16:07

%S 2024,9504,62744,496320,573560,677144,1000824,1173704,1208504,1921185,

%T 2140215,2198504,2312024,2580864,3847095,4012184,4682744,5416280,

%U 6618080,9247095,12500865,12970880,13496840,14371104,23939685,25942784,26409320,28644704,34093304

%N Lesser of reduced bi-unitary amicable pair.

%C A pair m < n is a reduced bi-unitary amicable pair if bsigma(m) = bsigma(n) = m + n + 1, where bsigma(n) is the sum of bi-unitary divisors of n (A188999).

%C The larger members are in A306871.

%H Amiram Eldar, <a href="/A306870/b306870.txt">Table of n, a(n) for n = 1..528</a> (terms below 2*10^11, from David Moews's site).

%H David Moews, <a href="http://djm.cc/amicable.html">Perfect, amicable and sociable numbers</a>.

%e 2024 is in the sequence since it is the lesser of the amicable pair (2024, 2295): bsigma(2024) = bsigma(2295) = 4320 = 2024 + 2295 + 1.

%t fun[p_, e_]:=If[OddQ[e], (p^(e+1)-1)/(p-1), (p^(e+1)-1)/(p-1)-p^(e/2)]; bsigma[1] = 1; bsigma[n_] := Times @@ (fun @@@ FactorInteger[n]); f[n_] := bsigma[n] - n - 1; s={}; Do[m = f[n]; If[m > n && f[m] == n, AppendTo[s, n]], {n, 1, 10^7}]; s

%Y Cf. A003502, A126172, A188999, A292980, A306871.

%K nonn

%O 1,1

%A _Amiram Eldar_, Mar 14 2019

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 April 24 18:15 EDT 2024. Contains 371962 sequences. (Running on oeis4.)