login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079321 Composite numbers of the form 1^1 * 2^2 * 3^3 * 4^4 * ... * n^n + 1. 0
27649, 86400001, 4031078400001, 3319766398771200001, 55696437941726556979200001, 21577941222941856209168026828800001, 215779412229418562091680268288000000000000001 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

No primes other than 2,5,109 found in this sequence for n <= 1000. Conjecture: There are no primes in the sequence 2^2 * 3^3 * 4^4 * ... *n^n + 1 for n > 3. Conjecture: There are no primes in the sequence 2^2 * 3^3 * 4^4 * ... * n^n + 61 for all n.

REFERENCES

D. E. Knuth, The Art of Computer Programming, Volume 1, 1997, p. 116, problem 7.

LINKS

Table of n, a(n) for n=1..7.

FORMULA

Prod(k^k, k=1..n)+1 is Composite. Exp(log(1) + 2log(2) + 3log(3) + ... klog(k)) = exp(Sum(k*log(k), k=1..n)).

MATHEMATICA

Select[1+#&/@FoldList[Times, 1, Table[n^n, {n, 10}]], !PrimeQ[#]&] (* Harvey P. Dale, May 02 2011 *)

PROG

(PARI) pcomposits(n, b) = { for(x=1, n, p=1; for(y=1, x, p = p*(y^y); ); if(!isprime(p+b), print1(p+b", ")); ) }

CROSSREFS

Cf. A002109.

Sequence in context: A097244 A101214 A202589 * A251235 A023198 A230608

Adjacent sequences:  A079318 A079319 A079320 * A079322 A079323 A079324

KEYWORD

easy,nonn

AUTHOR

Cino Hilliard, Feb 12 2003

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 11:30 EDT 2019. Contains 328295 sequences. (Running on oeis4.)