A204044 -id:A204044 - cp's OEIS frontend

A204041 Square Gaussian integer factorial, product of all Gaussian integers except 0 having a real or imaginary part less than or equal to n.

-4, 2560000, -19188605030400000000, 26257841860510325145600000000000000000000, -50074374492086859469933185828103742596055040000000000000000000000000000

Offset: 1

Alonso del Arte, Jan 09 2012

sign

This is called "square" because the Gaussian integers involved here form a square on the complex plane.

All terms are purely real integers, but a(6) has more than a hundred digits.

			a(1) = 1 * (1 + i) * i * (-1 + i) * -1 * (-1 - i) * -i * (1 - i) = -4.

Cf. A204044, lozenge factorial; A204043, circle factorial.

Table[Times@@ReplaceAll[Flatten[Table[a + b I, {a, -n, n}, {b, -n, n}]], 0 -> 1], {n, 10}]

A204043 Circle Gaussian integer factorial, product of all Gaussian integers except 0 having an absolute value less than or equal to n.

Original entry on oeis.org

-1, 64, -207360000, 15161366937600000000, -16026514807440384000000000000000000000000, 9186394651457723405912022826165758590976000000000000000000000000

Offset: 1

Alonso del Arte, Jan 09 2012

sign

Called "circle" because drawing a circle on the complex plane centered at 0 with radius n encloses the integers (with the exception of 0) that will be considered in computing a(n).

All terms of this sequence are purely real numbers.

			a(1) = 1 * i * -1 * -i = -1. (Note that numbers like -1 + i are ignored here).
a(5) = 5 * (4 + 3i) * (3 + 4i) * 5i * (-3 + 4i) * (-4 + 3i) * ... (Note that the absolute value of numbers like 4 + 3i is precisely 5).

Cf. A204041, square factorial; A204044, lozenge factorial.

Table[Times@@Select[ReplaceAll[Flatten[Table[a + b I, {a, -n, n}, {b, -n, n}]], 0 -> 1], Abs[#] <= n &], {n, 10}]

cp's OEIS Frontend

A204041 Square Gaussian integer factorial, product of all Gaussian integers except 0 having a real or imaginary part less than or equal to n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica