This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A121627 Real part of a complex operation analogous to the factorials. 1
 1, 0, -12, -96, -480, 0, 40320, 645120, 5806080, 0, -1277337600, -30656102400, -398529331200, 0, 167382319104000, 5356234211328000, 91055981592576000, 0, -62282291409321984000, -2491291656372879360000, -52317124783830466560000, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Conjecture (1): Current nonzero term divides next nonzero term; as an operation, getting a new sequence: 12, 8, 5, 84, 16, 9, 220, 24, 13, ...; using unsigned terms). Example: a(5) = -480 and a(7)= 40320, the next nonzero term in the sequence. Then 40320/480 = 84. Conjecture (2): If the term in (12, 8, 5, ...) is generated from a(n)/a(n-1) or a(n)/a(n-2), then n divides each (12, 8, 5, ...). Example: a(11) = -1277337600 and the previous nonzero term = a(9) = 5806080. Then a(11)/a(9) = 220 and 11 divides 220: 220/11 = 20. From Hieronymus Fischer, Nov 20 2011: (Start) Due to the statements (1) and (2) below a(n) divides a(n+k) for all k>=0, only provided both the residues of n (mod 8) and (n+k) (mod 8) are 0, 1, 3, 4, 5 or 7. As a consequence it follows that conjecture (1) plainly holds true (set k=1). From statements (1) and (2) it further follows that n! divides a(n) (for n with a(n)<>0) and therefore conjecture(2) also holds true. Statement(1): |a(n)| = 2^((n-1)/2)*n! for odd n (or n==1, 3, 5 or 7 (mod 8) respectively). Statement(2): |a(n)| = 2^(n/2)*n! for n==0 or 4 (mod 8). (End) LINKS FORMULA Let a(1) = 1, real part of (1 + i) = k(1); then k(n) = (n + ni) * k(n-1), n>1. a(n) = real part of each k(n). From Hieronymus Fischer, Nov 20 2011: (Start) a(n) = 2^(n/2)*n!*((-1)^floor((n+1)/4)*(1-(-1)^n)/sqrt(8)+(-1)^floor((n+2)/4)*(1-(-1)^floor((n+2)/2)*(1+(-1)^n)/4) a(n) = 2^(n/2)*n!*cos(n*Pi/4). a(n) = 2^(n/2)*n!*Re(exp(i*n*Pi/4)). a(n) = 0 iff n==2 (mod 8) or n==6 (mod 8); a(n) > 0 iff n==0 (mod 8) or n==1 (mod 8) or n==7 (mod 8); a(n) < 0 iff n==3 (mod 8) or n==4 (mod 8) or n==5 (mod 8). |a(n)| = 2^floor(n/2)*n! for n==0,1,3,4,5 or 7 (mod 8). Recursion: a(1)=1, a(n+1) = (n+1)*(a(n)-b(n)), where b(n) is the appropriately defined imaginary part with b(1)=1, b(n+1) = (n+1)*(a(n)+b(n)). (End) EXAMPLE a(3) = -12 since a(1) = (1 + i); (2 + 2i)* (1 + i) = (0 +4i); (3 + 3i)*(0 + 4i) = (-12 + 12i). MATHEMATICA a[1] = 1 + I; a[n_] := a[n] = a[n - 1]*(n + n*I); Table[Re[a[n]], {n, 22}] (* Or *) f[n_] := Fold[(#2 + #2*I)*#1 &, 1 + I, Range@n + 1]; Table[ Re[f[n]], {n, 0, 22}] (* Robert G. Wilson v *) PROG From Bruno Berselli, Nov 21 2011: (Start) (MAGMA) [Integers()!Real((1+Sqrt(-1))^n)*Factorial(n): n in [1..22]]; (Maxima) makelist(expand(((1-%i)^n+(1+%i)^n)*n!/2), n, 1, 22); (End) CROSSREFS Sequence in context: A192848 A229561 A120658 * A138162 A264418 A073392 Adjacent sequences:  A121624 A121625 A121626 * A121628 A121629 A121630 KEYWORD sign AUTHOR Gary W. Adamson, Aug 12 2006 EXTENSIONS More terms from Robert G. Wilson v, Aug 17 2006 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 August 18 15:00 EDT 2019. Contains 326106 sequences. (Running on oeis4.)