|
| |
| |
|
|
|
2, 2, 3, 7, 25, 121, 721, 5041, 40321, 362881, 3628801, 39916801, 479001601, 6227020801, 87178291201, 1307674368001, 20922789888001, 355687428096001, 6402373705728001, 121645100408832001
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| "For n = 4, 5 and 7, n!+1 is a square. Sierpinski asked if there are any other values of n with this property." p. 82 of Ogilvy and Anderson (see A146968).
Number of {12,12*,1*2,21*,2*1}-avoiding signed permutations in the hyperoctahedral group.
|
|
|
REFERENCES
| C. Stanley Ogilvy and John T. Anderson, Excursions in Number Theory, Oxford University Press, 1966, p. 82.
Waclaw Sierpinski, On some unsolved problems of arithmetics, Scripta Mathematica, vol. 25 (1960), p. 125.
Arthur T. White, Ringing the changes, Math. Proc. Cambridge Philos. Soc. 94 (1983), no. 2, 203-215.
|
|
|
LINKS
| Vincenzo Librandi, Table of n, a(n) for n = 0..300
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 763
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 834
T. Mansour and J. West, Avoiding 2-letter signed patterns.
G. P. Michon, Wilson's Theorem
Hisanori Mishima, Factorizations of many number sequences
Hisanori Mishima, Factorizations of many number sequences
Andrew Walker, Factors of n! +- 1
R. G. Wilson v, Explicit factorizations
Index entries for sequences related to factorial numbers
|
|
|
MATHEMATICA
| f[n_]:=n!+1; lst={}; Do[AppendTo[lst, f[n]], {n, 0, 5!}]; lst [From Vladimir Orlovsky, Jun 27 2009]
|
|
|
PROG
| (MAGMA) [Factorial(n) +1: n in [0..25]]; // Vincenzo Librandi, Jul 20 2011
|
|
|
CROSSREFS
| Cf. A000142, A033312, A002583, A051301, A056111, A002981.
Sequence in context: A076996 A139148 A185387 * A077001 A180996 A087522
Adjacent sequences: A038504 A038505 A038506 * A038508 A038509 A038510
|
|
|
KEYWORD
| nonn,easy,nice
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| Additional comments from Jason Earls (zevi_35711(AT)yahoo.com), Apr 01 2001
Numericana.com URL fixed by Gerard P. Michon (g.michon(AT)att.net), Mar 30 2010
|
| |
|
|
