login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A066135
a(n) = least number m > 1 such that sigma_n(m) = k*m for some k.
11
6, 10, 6, 34, 6, 10, 6, 84, 6, 10, 6, 34, 6, 10, 6, 84, 6, 10, 6, 34, 6, 10, 6, 194, 6, 10, 6, 34, 6, 10, 6, 84, 6, 10, 6, 34, 6, 10, 6, 84, 6, 10, 6, 34, 6, 10, 6, 228, 6, 10, 6, 34, 6, 10, 6, 84, 6, 10, 6, 34, 6, 10, 6, 84, 6, 10, 6, 34, 6, 10, 6, 194, 6, 10, 6
OFFSET
1,1
COMMENTS
a(n) <= 2p, where p = A002586(n) is the smallest prime factor of (1 + 2^n). (Proof. Since sigma_n(2p) = (1 + 2^n)(1 + p^n) and p is odd, 2p divides sigma_n(2p).) - Jonathan Sondow, Nov 23 2012
FORMULA
Sum{d^n} = ka(n), d runs over the divisors of a(n), where k is an integer and a(n) is the smallest suitable number.
MATHEMATICA
Table[m = 2; While[Mod[DivisorSigma[n, m], m] > 0, m++]; m, {n, 100}] (* T. D. Noe, Nov 23 2012 *)
CROSSREFS
Cf. A218860, A218861 (unique values and where they first occur).
Sequence in context: A247270 A010726 A084365 * A070393 A071630 A334937
KEYWORD
nonn
AUTHOR
Labos Elemer, Dec 06 2001
EXTENSIONS
Definition and formulas corrected by Jonathan Sondow, Nov 23 2012
STATUS
approved