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

2, 2, 3, 13, 289, 34561, 24883201, 125411328001, 5056584744960001, 1834933472251084800001, 6658606584104736522240000001, 265790267296391946810949632000000001

Offset: 0

Author

R. Muller

Keywords

• nonn
• easy

References

• M. Le, On the Interesting Smarandache Product Sequences, Smarandache Notions Journal, Vol. 9, No. 1-2, 1998, 133-134.
• F. Iacobescu, Smarandache Partition Type and Other Sequences, Bull. Pure Appl. Sciences, Vol. 16E, No. 2 (1997), pp. 237-240.

Links

• G. C. Greubel, Table of n, a(n) for n = 0..40
• F. Smarandache, Collected Papers, Vol. II, Vol. II, Tempus Publ. Hse., Bucharest, Romania, 1996.
• F. Smarandache, Sequences of Numbers Involved in Unsolved Problems.
• Eric Weisstein's World of Mathematics, Smarandache Sequences

Crossrefs

Cf. A000178.

Programs

Mathematica

FoldList[Times,1,Range[12]!]+1 (* Harvey P. Dale, Dec 11 2012 *)

Formula

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

Extensions

Name corrected by Arkadiusz Wesolowski, Oct 03 2011