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.

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

This page as a plain text file.
%I A366379 #7 Oct 22 2023 15:19:10
%S A366379 11,13,22,26,35,37,41,43,44,47,49,52,53,55,59,61,70,74,82,86,88,94,98,
%T A366379 104,106,110,118,122,131,133,137,139,140,143,145,148,149,151,155,157,
%U A366379 161,163,164,167,169,172,173,175,176,179,181,185,187,188,191,193,196,197,199,203,205,208,209,211,212,215,217,220
%N A366379 Numbers k such that A057889(k) != k (mod 3), where A057889 is the bijective bit-reverse.
%o A366379 (PARI)
%o A366379 A030101(n) = if(n<1,0,subst(Polrev(binary(n)),x,2));
%o A366379 A057889(n) = if(!n,n,A030101(n/(2^valuation(n,2))) * (2^valuation(n, 2)));
%o A366379 isA366379(n) = (!!((A057889(n)-n)%3));
%Y A366379 Cf. A030101, A057889, A366378 (complement), A366389.
%Y A366379 Subsequence of A001651, and of A057891.
%K A366379 nonn
%O A366379 1,1
%A A366379 _Antti Karttunen_, Oct 22 2023