login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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, 11977396665006561033796551, 1808586896415990716103279201, 291182490322974505292627951361 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
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).
Sum_{n>=1} 1/a(n) = (e/10^9)^(1/10)*(Gamma(1/10) - Gamma(1/10, 1/10)). - Amiram Eldar, Dec 22 2022
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
Sequence in context: A015287 A254782 A169960 * A144773 A061115 A098321
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 27 21:44 EDT 2024. Contains 372020 sequences. (Running on oeis4.)