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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A138523 a(n) = Sum_{k=1..n} (2k-1)!. 4
1, 7, 127, 5167, 368047, 40284847, 6267305647, 1313941673647, 357001369769647, 122002101778601647, 51212944273488041647, 25903229683158464681647, 15537113273014144448681647, 10904406563691366305216681647 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(n) is divisible by 107 for n >= 53. - Robert Israel, Dec 01 2015

Last digit is 7 for n > 1. Therefore there is no square in this sequence except 1. - Altug Alkan, Dec 01 2015

LINKS

G. C. Greubel, Table of n, a(n) for n = 1..225

FORMULA

Recurrence: a(1) = 1, a(2) = 7, a(n) = (4*n^2-6*n+3)*a(n-1) - 2*(n-1)*(2*n-1)*a(n-2). - Vladimir Reshetnikov, Oct 28 2015

MAPLE

a:=proc(n) options operator, arrow: sum(factorial(2*k-1), k=1..n) end proc: seq(a(n), n=1..14); # Emeric Deutsch, Mar 31 2008

MATHEMATICA

Table[Sum[(2i - 1)!, {i, n}], {n, 15}] (* Stefan Steinerberger, Mar 25 2008 *)

PROG

(PARI) a(n) = sum(k=1, n, (2*k-1)!); \\ Michel Marcus, Oct 28 2015

CROSSREFS

Cf. A007489, A138524, A138525.

Sequence in context: A092676 A002067 A274571 * A034670 A020516 A253851

Adjacent sequences:  A138520 A138521 A138522 * A138524 A138525 A138526

KEYWORD

easy,nonn

AUTHOR

Leroy Quet, Mar 23 2008

EXTENSIONS

More terms from Stefan Steinerberger, Emeric Deutsch and Robert G. Wilson v, Mar 25 2008

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 3 01:23 EDT 2020. Contains 333195 sequences. (Running on oeis4.)