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.

User: Patrick P Sheehan

Patrick P Sheehan's wiki page.

Patrick P Sheehan has authored 1 sequences.

A185271 Differences between consecutive norms of Gaussian primes.

Original entry on oeis.org

3, 4, 4, 4, 12, 8, 4, 8, 4, 8, 12, 16, 8, 4, 8, 4, 8, 16, 12, 8, 16, 8, 12, 4, 32, 4, 8, 16, 12, 8, 4, 12, 20, 4, 20, 12, 4, 8, 12, 16, 8, 4, 8, 12, 12, 16, 8, 4, 48, 12, 8, 12, 16, 12, 8, 16, 8, 12, 4, 24, 12, 8, 12, 4, 24, 8, 24, 24, 4, 8, 4, 24, 12, 12, 8
Offset: 1

Author

Patrick P Sheehan, Jan 25 2012

Keywords

Comments

If this sequence goes to infinity fast enough then the Gaussian moat-crossing problem is solved and it is impossible to walk to infinity in the complex plane using steps of bounded length stepping only on Gaussian primes.

Examples

			The first Gaussian prime (restricting ourselves to the first octant) is 1+i which has norm 2 (1^2+1^2). The second is 2+i with norm 5 (2^2+1^2). The difference in those norms is 3, the first term in this sequence.
		

Crossrefs

Cf. A055025 (norms of Gaussian primes).

Formula

a(n) = A055025(n+1) - A055025(n).