cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A222596 Length of the closed curve through Gaussian primes described in A222594.

Original entry on oeis.org

6, 64, 64, 8, 32, 92, 92, 32, 8, 32, 12, 92, 32, 12, 48, 412, 12, 412, 48, 48, 92, 92, 44, 92, 92, 12, 1316, 48, 44, 412, 48, 48, 412, 412, 24, 44, 24, 48, 1316, 12, 8, 48, 1316, 412, 44, 1316, 1316, 12, 12, 1316, 1316, 1316, 412, 44, 412, 204, 1316, 28, 72, 412
Offset: 1

Views

Author

T. D. Noe, Feb 27 2013

Keywords

Comments

The Gaussian prime spiral is described in the short note by O'Rourke and Wagon. It is not known if every iteration is a closed loop. See A222594 and A222595 for the number of line segments between primes.

References

  • Joseph O'Rourke and Stan Wagon, Gaussian prime spirals, Mathematics Magazine, vol. 86, no. 1 (2013), p. 14.

Crossrefs

Cf. A222298 (spiral lengths beginning at the n-th positive real Gaussian prime).

Programs

  • Mathematica
    loop[n_] := Module[{p = n, direction = 1}, lst = {n}; While[While[p = p + direction; ! PrimeQ[p, GaussianIntegers -> True]]; direction = direction*(-I); AppendTo[lst, p]; ! (p == n && direction == 1)]; Length[lst]]; nn = 20; ps = {}; Do[If[PrimeQ[i + (j - i) I, GaussianIntegers -> True], AppendTo[ps, i + (j-i)*I]], {j, 0, nn}, {i, 0, j}]; Table[loop[ps[[n]]]; Total[Abs[Differences[lst]]], {n, Length[ps]}]

A222298 Length of the Gaussian prime spiral beginning at the n-th positive real Gaussian prime (A002145).

Original entry on oeis.org

12, 12, 260, 12, 236, 28, 28, 28, 28, 236, 20, 44, 44, 20, 20, 36, 76, 12, 12, 4, 12, 4, 36, 36, 36, 3276, 76, 36, 36, 3276, 84, 20, 12, 12, 20, 36, 36, 2444, 2444, 36, 44, 1356, 156, 28, 12, 220, 12, 12, 84, 12, 132, 28, 68, 36, 36, 1044, 20, 20, 28, 1044, 20
Offset: 1

Views

Author

T. D. Noe, Feb 25 2013

Keywords

Comments

The Gaussian prime spiral is described in the short note by O'Rourke and Wagon. It is not known if every iteration is a closed loop. See A222299 for the number of distinct primes on the spiral. See A222300 for the length of the spiral (which is the same as the number of numbers tested for primality, without memory).
This idea can be extended to any Gaussian prime. Sequences A222594, A222595, and A222596 show the results for first-quadrant Gaussian primes. - T. D. Noe, Feb 27 2013

Examples

			The loop beginning with 31 is {31, 43, 43 - 8i, 37 - 8i, 37 - 2i, 45 - 2i, 45 - 8i, 43 - 8i, 43, 47, 47 - 2i, 45 - 2i, 45 + 2i, 47 + 2i, 47, 43, 43 + 8i, 45 + 8i, 45 + 2i, 37 + 2i, 37 + 8i, 43 + 8i, 43, 31, 31 + 4i, 41 + 4i, 41 - 4i, 31 - 4i, 31}. The first and last numbers are the same. So only one is counted.
		

References

  • Joseph O'Rourke and Stan Wagon, Gaussian prime spirals, Mathematics Magazine, vol. 86, no. 1 (2013), p. 14.

Programs

  • Mathematica
    loop[n_] := Module[{p = n, direction = 1}, lst = {n}; While[While[p = p + direction; ! PrimeQ[p, GaussianIntegers -> True]]; direction = direction*(-I); AppendTo[lst, p]; ! (p == n && direction == 1)]; Length[lst]]; cp = Select[Range[1000], PrimeQ[#, GaussianIntegers -> True] &]; Table[loop[p]-1, {p, cp}]
Showing 1-2 of 2 results.