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.

A364567 a(n) = A297112(A005940(1+n)), where A297112 is the Möbius transform of A156552 [the inverse of map n -> A005940(1+n)].

This page as a plain text file.
%I A364567 #18 Aug 07 2023 08:32:21
%S A364567 0,1,2,2,4,2,4,4,8,4,4,4,8,4,8,8,16,8,8,8,8,4,8,8,16,8,8,8,16,8,16,16,
%T A364567 32,16,16,16,16,8,16,16,16,8,8,8,16,8,16,16,32,16,16,16,16,8,16,16,32,
%U A364567 16,16,16,32,16,32,32,64,32,32,32,32,16,32,32,32,16,16,16,32,16,32,32,32,16,16,16,16,8,16,16
%N A364567 a(n) = A297112(A005940(1+n)), where A297112 is the Möbius transform of A156552 [the inverse of map n -> A005940(1+n)].
%H A364567 Antti Karttunen, <a href="/A364567/b364567.txt">Table of n, a(n) for n = 0..16383</a>
%H A364567 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F A364567 For n > 0, a(n) = 2^A033265(n).
%o A364567 (PARI) A364567(n) = if(!n,n, my(i=1); while(n>1, if((n%4)!=1, i<<=1); n >>= 1); (i));
%Y A364567 Cf. A005940, A033265, A156552, A297112, A364568.
%Y A364567 Cf. also A364571.
%K A364567 nonn
%O A364567 0,3
%A A364567 _Antti Karttunen_, Aug 05 2023