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.

A376405 Bitwise XOR (centrally aligned) of two consecutive terms of A122245.

This page as a plain text file.
%I A376405 #10 Sep 23 2024 14:13:17
%S A376405 176,584,2068,9232,38952,135296,567096,2444568,10136288,34920688,
%T A376405 144732808,625792608,2598216176,8989149792,37119010736,160422522664,
%U A376405 665656629200,2297815400576,9505629937992,41066855413976,169932530966160,589165636912400,2439104800321640,10514745879265952,43543845360254320,149771860125187648
%N A376405 Bitwise XOR (centrally aligned) of two consecutive terms of A122245.
%H A376405 Antti Karttunen, <a href="/A376405/b376405.txt">Table of n, a(n) for n = 1..1650</a>
%H A376405 Antti Karttunen, <a href="/A080069/a080069.py.txt">Python program for computing this sequence and the associated images.</a>
%H A376405 Antti Karttunen, <a href="/A376405/a376405.txt">Terms a(1)-a(2048) drawn as binary strings, in Wolframesque fashion.</a>
%H A376405 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F A376405 a(n) = A122245(1+n) XOR 2*A122245(n).
%o A376405 (PARI) A376405(n) = bitxor(A122245(1+n), 2*A122245(n));
%o A376405 (Python) # See the Links section
%Y A376405 Cf. A122245 (A014486, A057548, A082358, A122237, A122244).
%Y A376405 Cf. also A327973, A376402, A376415.
%K A376405 nonn,base
%O A376405 1,1
%A A376405 _Antti Karttunen_, Sep 22 2024