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!)
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 (list; graph; refs; listen; history; text; internal format)
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
LINKS
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

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 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)