login
a(n) = 1 + 0!*1!*2!*...*n!.
6

%I #23 Feb 16 2025 08:32:33

%S 2,2,3,13,289,34561,24883201,125411328001,5056584744960001,

%T 1834933472251084800001,6658606584104736522240000001,

%U 265790267296391946810949632000000001

%N a(n) = 1 + 0!*1!*2!*...*n!.

%D M. Le, On the Interesting Smarandache Product Sequences, Smarandache Notions Journal, Vol. 9, No. 1-2, 1998, 133-134.

%D F. Iacobescu, Smarandache Partition Type and Other Sequences, Bull. Pure Appl. Sciences, Vol. 16E, No. 2 (1997), pp. 237-240.

%H G. C. Greubel, <a href="/A019515/b019515.txt">Table of n, a(n) for n = 0..40</a>

%H F. Smarandache, <a href="http://www.gallup.unm.edu/~smarandache/CP2.pdf">Collected Papers, Vol. II</a>, Vol. II, Tempus Publ. Hse., Bucharest, Romania, 1996.

%H F. Smarandache, <a href="http://www.gallup.unm.edu/~smarandache/Sequences-book.pdf">Sequences of Numbers Involved in Unsolved Problems</a>.

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SmarandacheSequences.html">Smarandache Sequences</a>

%F a(n) = A000178(n) + 1.

%t FoldList[Times,1,Range[12]!]+1 (* _Harvey P. Dale_, Dec 11 2012 *)

%Y Cf. A000178.

%K nonn,easy

%O 0,1

%A R. Muller

%E Name corrected by _Arkadiusz Wesolowski_, Oct 03 2011