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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A046882 Ultrafactorials: n!^n!. 8
1, 1, 4, 46656, 1333735776850284124449081472843776 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

a(5) = 3175 042373 780336 892901 667920 556557 182493 442088 021222 004926 225128 381629 943118 937129 098831 435345 716937 405655 305190 657814 877412 786176 000000 000000 000000 000000 000000 000000 000000 000000 000000 000000 000000 000000 000000 000000 000000 000000 000000 000000 000000 000000. - Jonathan Vos Post (jvospost3(AT)gmail.com), Dec 09 2004

Note that, by analogy with factorial primes, subfactorial primes, superfactorial primes and hyperfactorial primes, that if a(n)+1 or a(n)-1 is prime, it should be called an ultrafactorial prime. These begin: a(0)+1 = a(1)+1 = 2, a(2)-1 = 3, a(2)+1 = 5. Are there any more? Note that a(3) = 46657 = 13 * 37 * 97 is a 3-brilliant number. a(3)-5, a(3)-3 and a(3)+5 are semiprime; a(3)-7 and a(3)+7 are primes. - Jonathan Vos Post (jvospost3(AT)gmail.com), Dec 09 2004

LINKS

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

Eric Weisstein's World of Mathematics, Ultrafactorial.

MATHEMATICA

lst={}; Do[a=n!^n!; AppendTo[lst, a], {n, 6}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Oct 01 2008]

CROSSREFS

Cf. A002109.

Cf. A000166, A000178, A002982, A002109.

Sequence in context: A053937 A173138 A132638 * A165812 A074318 A102200

Adjacent sequences:  A046879 A046880 A046881 * A046883 A046884 A046885

KEYWORD

nonn

AUTHOR

Camillo Lamonaca (Camillo.Lamonaca(AT)dva.gov.au)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 02:48 EST 2012. Contains 205978 sequences.