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 A322575 #12 Aug 27 2024 18:30:27 %S A322575 0,0,1,0,-1,0,3,0,-3,1,4,1,-2,0,3,0,-3,-1,2,-1,-4,0,1,0,-1,3,4,3,2,0, %T A322575 8,0,-8,-3,-2,-3,-4,1,5,1,-3,4,13,4,-5,1,2,1,0,-2,5,-2,-9,0,7,0,-7,3, %U A322575 7,3,-1,0,11,0,-11,-3,2,-3,-8,-1,4,-1,-6,2,10,2 %N A322575 z(1) = 0, and for any n > 0, z(4*n-2) = z(n) + k(n), z(4*n-1) = z(n) + i*k(n), z(4*n) = z(n) - k(n) and z(4*n+1) = z(n) - i*k(n) where k(n) is the least positive integer not leading to a duplicate term in sequence z (and i denotes the imaginary unit); a(n) is the imaginary part of z(n). %H A322575 Rémy Sigrist, <a href="/A322575/b322575.txt">Table of n, a(n) for n = 1..10000</a> %H A322575 Rémy Sigrist, <a href="/A322575/a322575.gp.txt">PARI program for A322575</a> %o A322575 (PARI) \\ See Links section. %Y A322575 See A322574 for the real part of z and additional comments. %K A322575 sign,look %O A322575 1,7 %A A322575 _Rémy Sigrist_, Dec 17 2018