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.

A304759 Binary encoding of 1-digits in ternary representation of A048673(n).

This page as a plain text file.
%I A304759 #19 Jul 21 2025 00:23:39
%S A304759 1,0,2,2,3,0,0,6,7,4,1,2,4,4,0,14,5,12,6,10,9,0,4,6,1,0,4,10,5,8,1,30,
%T A304759 8,8,14,26,2,8,13,22,3,16,0,2,17,12,8,14,1,0,10,2,10,0,9,22,3,8,11,18,
%U A304759 9,0,18,62,0,20,12,18,1,24,13,54,15,0,28,18,0,24,12,46,37,4,8,34,7,4,0,6,11,32,23,26,22,0
%N A304759 Binary encoding of 1-digits in ternary representation of A048673(n).
%C A304759 Compare the logarithmic scatterplot to those of A291759, A292250 and A304760.
%H A304759 Antti Karttunen, <a href="/A304759/b304759.txt">Table of n, a(n) for n = 1..16383</a>
%H A304759 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F A304759 a(n) = A289813(A048673(n)).
%o A304759 (PARI)
%o A304759 A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From A003961
%o A304759 A048673(n) = (A003961(n)+1)/2;
%o A304759 A289813(n) = { my (d=digits(n, 3)); fromdigits(vector(#d, i, if (d[i]==1, 1, 0)), 2); } \\ From A289813
%o A304759 A304759(n) = A289813(A048673(n));
%Y A304759 Cf. A048673, A289813, A304758 (rgs-transform), A340381.
%Y A304759 Cf. also A291759, A292250, A304760, A305295.
%Y A304759 Cf. A340376 (positions of zeros), A340378 (binary weight).
%K A304759 nonn,look,base
%O A304759 1,3
%A A304759 _Antti Karttunen_, May 30 2018