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.

A366378 Numbers k such that A057889(k) == k (mod 3), where A057889 is the bijective bit-reverse.

This page as a plain text file.
%I A366378 #7 Oct 22 2023 15:14:49
%S A366378 0,1,2,3,4,5,6,7,8,9,10,12,14,15,16,17,18,19,20,21,23,24,25,27,28,29,
%T A366378 30,31,32,33,34,36,38,39,40,42,45,46,48,50,51,54,56,57,58,60,62,63,64,
%U A366378 65,66,67,68,69,71,72,73,75,76,77,78,79,80,81,83,84,85,87,89,90,91,92,93,95,96,97,99,100,101,102,103
%N A366378 Numbers k such that A057889(k) == k (mod 3), where A057889 is the bijective bit-reverse.
%o A366378 (PARI)
%o A366378 A030101(n) = if(n<1,0,subst(Polrev(binary(n)),x,2));
%o A366378 A057889(n) = if(!n,n,A030101(n/(2^valuation(n,2))) * (2^valuation(n, 2)));
%o A366378 isA366378(n) = !((A057889(n)-n)%3);
%Y A366378 Cf. A030101, A057889, A366379 (complement), A366389.
%Y A366378 Subsequences: A000079, A008585, A057890.
%K A366378 nonn
%O A366378 1,3
%A A366378 _Antti Karttunen_, Oct 22 2023