The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A045757 10-factorial numbers. 15
 1, 11, 231, 7161, 293601, 14973651, 913392711, 64850882481, 5252921480961, 478015854767451, 48279601331512551, 5359035747797893161, 648443325483545072481, 84946075638344404495011 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS G. C. Greubel, Table of n, a(n) for n = 1..323 FORMULA a(n) = Pochhammer(1/10,n)*10^n. a(n+1) = (10*n+1)(!^10) = Product_{k=0..n} (10*k+1), n >= 0. E.g.f.: -1 + (1-10*x)^(-1/10). MAPLE G(x):=-1+(1-10*x)^(-1/10): f[0]:=G(x): for n from 1 to 29 do f[n]:=diff(f[n-1], x) od: x:=0: seq(f[n], n=1..14); # Zerinvary Lajos, Apr 03 2009 seq(mul(10*j+1, j = 0..n-1), n = 1..20); # G. C. Greubel, Nov 11 2019 MATHEMATICA FoldList[Times, 10*Range[0, 20]+1] (* Harvey P. Dale, Dec 02 2016 *) PROG (PARI) vector(21, n, prod(j=0, n-1, 10*j+1) ) \\ G. C. Greubel, Nov 11 2019 (MAGMA) [(&*[10*j+1: j in [0..n-1]]): n in [1..20]]; // G. C. Greubel, Nov 11 2019 (Sage) [product( (10*j+1) for j in (0..n-1)) for n in (1..20)] # G. C. Greubel, Nov 11 2019 (GAP) List([1..20], n-> Product([0..n-1], j-> 10*j+1) ); # G. C. Greubel, Nov 11 2019 CROSSREFS Cf. A035265, A035272, A035273, A035274, A035275, A035276, A035277, A035278, A035279. Cf. A008542, A048176. Sequence in context: A015287 A254782 A169960 * A144773 A061115 A098321 Adjacent sequences:  A045754 A045755 A045756 * A045758 A045759 A045760 KEYWORD easy,nonn AUTHOR 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.

Last modified November 26 03:20 EST 2020. Contains 338632 sequences. (Running on oeis4.)