The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A084116 Numbers m such that A084115(m) = 1. 5
 2, 3, 5, 6, 7, 8, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 27, 29, 31, 33, 34, 35, 37, 38, 39, 41, 43, 46, 47, 51, 53, 55, 57, 58, 59, 61, 62, 65, 67, 69, 71, 73, 74, 77, 79, 82, 83, 85, 86, 87, 89, 91, 93, 94, 95, 97, 101, 103, 106, 107, 109, 111, 113, 115, 118, 119 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS A084113(a(n)) = A084114(a(n)) + 1. Union of primes and multiplicatively perfect numbers (A000040, A007422). A084115(a(n)) = 1; A066729(a(n)) = a(n). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 Eric Weisstein's World of Mathematics, Multiplicative Perfect Number. FORMULA It appears that a(n) = n such that A000005(n)^A000005(n)+1 is prime. - Carl Najafi, Oct 19 2011 MATHEMATICA Select[Range[2, 200], PrimeQ[DivisorSigma[0, #]^DivisorSigma[0, #] + 1] &] (* Carl Najafi, Oct 19 2011 *) PROG (Haskell) a084116 n = a084116_list !! (n-1) a084116_list = filter ((== 1) . a084115) [1..] -- Reinhard Zumkeller, Jul 31 2014 (PARI) is(n)=isprime(n) || numdiv(n) == 4 \\ Charles R Greathouse IV, Oct 19 2015 CROSSREFS Cf. A084110, A066729, A084113, A084114, A084115, A066423 (complement). Sequence in context: A336591 A036537 A072510 * A137620 A336487 A028765 Adjacent sequences:  A084113 A084114 A084115 * A084117 A084118 A084119 KEYWORD nonn AUTHOR Reinhard Zumkeller, May 12 2003 EXTENSIONS Corrected and edited by Carl Najafi, Oct 19 2011 Revised by Reinhard Zumkeller, Jul 31 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 22 22:24 EDT 2020. Contains 337291 sequences. (Running on oeis4.)