cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 21-22 of 22 results.

A088826 Solutions to sigma(n)-2*n = phi(n): abundance of n equals Euler-phi of n.

Original entry on oeis.org

12, 42, 1242, 6137440, 1385119360, 1588268480
Offset: 1

Views

Author

Labos Elemer, Oct 27 2003

Keywords

Comments

a(7) > 10^12. - Donovan Johnson, Feb 29 2012
10^13 < a(7) <= 479535318548480. Other terms of the form 2^k*5*p*q are 983990190817280, 528322308638228480, 1374972658786140160, 9222951307429806080 and 13732480001814200320. - Giovanni Resta, Jul 12 2013
248248256622696037089280 and 29053620223944172891013120 are the next two terms of the form 2^k*5*p*q where p&q are distinct primes. 12, 42 and 1242 are the only terms of one of the three forms 4*p, 2*p*q and 2*p^3*q where p and q are two distinct primes. Farideh Firoozbakht, Aug 19 2013

Examples

			n=1242, sigma(1242)=2880, 2880-2484=396=phi(1242).
		

Crossrefs

Programs

  • Mathematica
    Do[If[Equal[DivisorSigma[1, n]-2*n, EulerPhi[n]], Print[n]], {n, 1, 10000000}]

Extensions

a(5)-a(6) from Donovan Johnson, Sep 30 2009

A124109 Numbers whose abundance (A033880) or deficiency (A033879) is a semiprime number.

Original entry on oeis.org

5, 7, 11, 12, 14, 15, 21, 23, 26, 27, 34, 35, 39, 40, 44, 47, 52, 55, 57, 58, 59, 63, 65, 68, 70, 72, 74, 75, 77, 80, 82, 83, 85, 88, 93, 98, 107, 110, 115, 116, 119, 122, 125, 129, 133, 143, 144, 152, 155, 160, 162, 164, 167, 169, 171, 178, 179, 183, 185, 187, 189
Offset: 1

Views

Author

Jonathan Vos Post, Nov 26 2006

Keywords

Comments

If p is prime, then the only divisors of p are 1 and p, so sigma(p) = p + 1 and abundance(p) = abs(sigma(p) - 2*p) = abs((p+1) - 2*p) = abs(1-p) = p-1. Hence this sequence includes all values of the sequence of the primes which are one more than semiprimes. This is identical to A005385 Safe primes p: (p-1)/2 is also prime [then (p-1)/2 is called a Sophie Germain prime: see A005384] since as Zak Seidov commented, this is identical to primes p such that p-1 is a semiprime]. But the current sequence also contains composites, such as a(4) = 12, a(5) = 14, a(6) = 15 and a(7) = 21. If k = p*q is a semiprime (with p and q distinct primes) then the only divisors of k are 1, p, q and p*q, so sigma(k) = 1 + p + q + p*q and abs(abundance(k)) = abs(1 + p + q + p*q - p*q) = abs(1 + p + q) and these are in the sequence if 1 + p + q is semiprime. Note that numbers can be in the sequence which are neither prime nor semiprime, starting with a(4) = 12 and a(10) = 27.

Examples

			a(1) = 5 because abs(sigma(5) - 2*5) = abs(6-10) = abs(-4) = 4 = 2^2 is semiprime.
a(2) = 7 because abs(sigma(7) - 2*7) = abs(8-14) = abs(-6) = 6 = 2 * 3 is semiprime.
a(3) = 11 because abs(sigma(11) - 2*11) = abs(12-22) = abs(-10) = 10 = 2 * 5 is semiprime.
a(4) = 12 because abs(sigma(12) - 2*12) = abs(28-24) = abs(-4) = 4 = 2^2 is semiprime.
a(5) = 14 because abs(sigma(14) - 2*14) = abs(24-28) = abs(+4) = 4 = 2^2 is semiprime.
a(6) = 15 because abs(sigma(15) - 2*15) = abs(24-30) = abs(-6) = 6 = 2 * 3 is semiprime.
a(7) = 21 because abs(sigma(21) - 2*21) = abs(32-42) = abs(-10) = 10 = 2 * 5 is semiprime.
a(8) = 23 because abs(sigma(23) - 2*23) = abs(24-46) = abs(-22) = 22 = 2 * 11 is semiprime.
		

Crossrefs

Programs

  • Mathematica
    semiPrimeQ[n_] := Plus @@ Last /@ FactorInteger@n == 2; Select[ Range@ 193, semiPrimeQ@Abs[DivisorSigma[1, # ] - 2# ] &] (* Robert G. Wilson v *)

Formula

Abs[sigma(a(n)) - 2*a(n)] is a semiprime, where sigma(k) = sum of divisors of k. {Abs[sigma(a(n)) - 2*a(n)]} is in A001358.

Extensions

More terms from Robert G. Wilson v, Nov 29 2006
Previous Showing 21-22 of 22 results.