User:Matthew Conroy

I received my Ph.D. in mathematics, with a dissertation in number theory, from the University of Colorado, Boulder in 1997. My thesis advisor was Peter Elliott.

I have been on the Mathematics faculty of the University of Washington, Seattle, since 2001.

---

Sequences of which I am listed as the author:

A004394 Superabundant [or super-abundant] numbers: n such that sigma(n)/n > sigma(m)/m for all m < n, sigma(n) being A000203(n), the sum of the divisors of n.

A060324 a(n) is the minimal prime q such that n*(q+1)-1 is prime, that is, the smallest prime q so that n = (p+1)/(q+1) with p prime; or a(n) = -1 if no such q exists.

A060424 Record-setting n's for the function q(n), the minimum prime q such that n(q+1)-1 is prime p (i.e., q(n) > q(j) for all 0 < j < n).

A064692 Total number of holes in decimal expansion of the number n, assuming 4 has 1 hole.

A064693 Number of connected components remaining when decimal expansion of the number n is cut from a piece of paper.

A066419 Numbers k such that k! is not divisible by the sum of the decimal digits of k!.

A114061 Numbers n such that n = (product of digits of n) * (sum of digits of n) in some base.

A178830 Number of distinct partitions of {1,...,n} into two nonempty sets P and S with the product of the elements of P equal to the sum of elements in S.

A261752 Minimum number of knights on an n X n chessboard such that every square is attacked.

A288677 Every element of Z/nZ can be expressed as a sum of no more than a(n) squares.

A381708 a(n) is the smallest nonnegative integer k such that sigma_k(n) > sigma_k(j) for all 1 <= j < n.