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 A376412 #12 Sep 23 2024 14:13:21 %S A376412 14544,64920,258096,925720,3703264,16562224,66158664,237396008, %T A376412 948568384,4239130768,16949182920,60767078320,243080890624, %U A376412 1085016114240,4341071150792,15535530051144,62225888982288,277421534227968,1111070191401136,3979658311943880,15908408006551904,71162952082313488,284082756324759560,1019946695587234480 %N A376412 a(n) = A122242(4+n) XOR 16*A122242(n). %C A376412 See comments in A376415. %H A376412 Antti Karttunen, <a href="/A376412/b376412.txt">Table of n, a(n) for n = 1..1650</a> %H A376412 Antti Karttunen, <a href="/A080069/a080069.py.txt">Python program for computing this sequence and the associated images.</a> %H A376412 Antti Karttunen, <a href="/A376412/a376412.png">Terms a(1)-a(768) drawn as binary strings, in Wolframesque fashion.</a> %H A376412 Antti Karttunen, <a href="/A376412/a376412_1.png">The central parts of terms a(1) - a(20000) drawn in similar fashion.</a> (the widening blank corridor in the middle corresponds with the "central crystallization" attractor present in A122242) %H A376412 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %F A376412 a(n) = A122242(4+n) XOR 16*A122242(n). %o A376412 (PARI) A376412(n) = bitxor(A122242(4+n), 16*A122242(n)); %o A376412 (Python) # See the Links section %Y A376412 Cf. A122242 (A014486, A057548, A082358, A122237, A122241). %Y A376412 Cf. also A327973, A376402, A376415. %K A376412 nonn,base %O A376412 1,1 %A A376412 _Antti Karttunen_, Sep 22 2024