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.
%I A185271 #22 Feb 16 2025 08:33:13 %S A185271 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, %T A185271 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, %U A185271 8,12,4,24,12,8,12,4,24,8,24,24,4,8,4,24,12,12,8 %N A185271 Differences between consecutive norms of Gaussian primes. %C A185271 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. %H A185271 Amiram Eldar, <a href="/A185271/b185271.txt">Table of n, a(n) for n = 1..10000</a> %H A185271 Eric W. Weisstein, <a href="https://mathworld.wolfram.com/GaussianPrime.html">MathWorld: Gaussian Prime</a> %H A185271 Eric W. Weisstein, <a href="https://mathworld.wolfram.com/Moat-CrossingProblem.html">MathWorld: Moat-Crossing Problem</a> %H A185271 Wikipedia, <a href="http://en.wikipedia.org/wiki/Gaussian_integer">Gaussian Integer</a> %H A185271 <a href="https://oeis.org/index/Ga#gaussians">Index entries for Gaussian integers and primes</a> %F A185271 a(n) = A055025(n+1) - A055025(n). %e A185271 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. %Y A185271 Cf. A055025 (norms of Gaussian primes). %K A185271 nonn,easy %O A185271 1,1 %A A185271 _Patrick P Sheehan_, Jan 25 2012