# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a304758
Showing 1-1 of 1

%I A304758 #5 May 31 2018 08:14:55
%S A304758 1,2,3,3,4,2,2,5,6,7,1,3,7,7,2,8,9,10,5,11,12,2,7,5,1,2,7,11,9,13,1,
%T A304758 14,13,13,8,15,3,13,16,17,4,18,2,3,19,10,13,8,1,2,11,3,11,2,12,17,4,
%U A304758 13,20,21,12,2,21,22,2,23,10,21,1,24,16,25,26,2,27,21,2,24,10,28,29,7,13,30,6,7,2,5,20,31,32,15,17,2,18,14,13,2,1,3,12,18,2,5
%N A304758 Restricted growth sequence transform of A304759(n), formed from 1-digits in ternary representation of A048673(n).
%H A304758 Antti Karttunen, <a href="/A304758/b304758.txt">Table of n, a(n) for n = 1..65537</a>
%o A304758 (PARI)
%o A304758 A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From A003961
%o A304758 A048673(n) = (A003961(n)+1)/2;
%o A304758 A289813(n) = { my (d=digits(n, 3)); from digits(vector(#d, i, if (d[i]==1, 1, 0)), 2); } \\ From A289813
%o A304758 A304759(n) = A289813(A048673(n));
%o A304758 rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,invec[i],i); outvec[i] = u; u++ )); outvec; };
%o A304758 v304758 = rgs_transform(vector(65537,n,A304759(n)));
%o A304758 A304758(n) = v304758[n];
%Y A304758 Cf. A048673, A289813, A304759.
%Y A304758 Cf. also A304740, A304748.
%K A304758 nonn
%O A304758 1,2
%A A304758 _Antti Karttunen_, May 30 2018

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE