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.

A231364 Numbers n such that antisigma(n) = antisigma(k) has solution for distinct numbers n and k.

Original entry on oeis.org

1, 2, 5, 6, 8585, 8586, 16119, 16020, 29886159, 29886160
Offset: 1

Views

Author

Jaroslav Krizek, Nov 10 2013

Keywords

Comments

Antisigma(n) = A024816(n) = the sum of the non-divisors of n that are between 1 and n. a(9) > 10^5. Conjecture: a(9) = 29886159, a(10) = 29886160.

Examples

			5 and 6 are in the sequence because antisigma(5) = antisigma(6) = 9.
		

Crossrefs

Cf. A067816 (numbers n such that antisigma(n) = antisigma(n+1)).
Cf. A206036 (numbers n such that sigma(n) = sigma(k) has solution for distinct numbers n and k).
Cf. A225775 (numbers k such that antisigma(x) = antisigma(x+1) = k has solution).

Extensions

a(9)-a(10) from Donovan Johnson, Nov 12 2013