login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A305298 Restricted growth sequence transform of A291763, formed from 2-digits in ternary representation of A291763(n). 4

%I #7 Jun 01 2018 21:41:47

%S 1,2,2,1,2,1,3,1,2,4,2,5,6,7,2,8,2,9,10,11,2,8,12,9,13,8,14,1,2,1,3,8,

%T 2,15,16,17,18,7,19,20,2,21,3,22,23,9,16,1,24,25,6,1,12,11,3,26,2,4,2,

%U 7,6,8,6,1,2,27,28,29,30,31,32,1,33,34,35,36,37,25,38,7,2,4,39,7,6,40,30,11,32,41,42,43,30,22,2,4,19,1,44,45,13,43,46,4

%N Restricted growth sequence transform of A291763, formed from 2-digits in ternary representation of A291763(n).

%C For all i, j: a(i) = a(j) => A292262(i) = A292262(j).

%C For all i, j: a(i) = a(j) => A305432(i) = A305432(j).

%H Antti Karttunen, <a href="/A305298/b305298.txt">Table of n, a(n) for n = 0..65537</a>

%o (PARI)

%o A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From A003961

%o A048673(n) = (A003961(n)+1)/2;

%o A254049(n) = A048673((2*n)-1);

%o A245612(n) = if(n<2,1+n,if(!(n%2),(3*A245612(n/2))-1,A254049(A245612((n-1)/2))));

%o A289814(n) = { my (d=digits(n, 3)); fromdigits(vector(#d, i, if (d[i]==2, 1, 0)), 2); } \\ From A289814

%o A291763(n) = A289814(A245612(n));

%o 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 v305298 = rgs_transform(vector(65538,n,A291763(n-1)));

%o A305298(n) = v305298[1+n];

%Y Cf. A245612, A289814, A291763, A292262, A305432.

%Y Cf. also A305296, A305297.

%Y Cf. also A304746, A304748.

%K nonn

%O 0,2

%A _Antti Karttunen_, May 31 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 11:21 EDT 2024. Contains 371936 sequences. (Running on oeis4.)