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.

A305295 Binary encoding of 1-digits in ternary representation of A245612(n).

This page as a plain text file.
%I A305295 #9 Jul 20 2025 17:40:48
%S A305295 1,0,2,2,6,7,0,3,14,4,12,1,2,0,4,0,30,37,0,5,26,28,0,1,6,17,8,14,10,9,
%T A305295 4,1,62,16,72,103,2,90,8,0,54,25,60,33,2,32,0,19,14,40,32,40,18,11,24,
%U A305295 0,22,18,16,9,10,8,0,4,126,333,36,305,146,4,204,331,6,147,176,44,18,225,8,121,110,214,48,203,122,6,64,78,6,1
%N A305295 Binary encoding of 1-digits in ternary representation of A245612(n).
%H A305295 Antti Karttunen, <a href="/A305295/b305295.txt">Table of n, a(n) for n = 0..16383</a>
%H A305295 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A305295 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%o A305295 (PARI)
%o A305295 A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From A003961
%o A305295 A048673(n) = (A003961(n)+1)/2;
%o A305295 A254049(n) = A048673((2*n)-1);
%o A305295 A245612(n) = if(n<2,1+n,if(!(n%2),(3*A245612(n/2))-1,A254049(A245612((n-1)/2))));
%o A305295 A289813(n) = { my (d=digits(n, 3)); fromdigits(vector(#d, i, if (d[i]==1, 1, 0)), 2); } \\ From A289813
%o A305295 A305295(n) = A289813(A245612(n));
%Y A305295 Cf. A245612, A289813, A305296 (rgs-transform).
%Y A305295 Cf. also A292260, A291763.
%Y A305295 Cf. also A304759, A304760.
%K A305295 nonn,base
%O A305295 0,3
%A A305295 _Antti Karttunen_, May 31 2018