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.

A304114 Restricted growth sequence transform of A246277(A098550(n)), related to indices in the prime factorization of Yellowstone permutation.

This page as a plain text file.
%I A304114 #7 May 17 2018 17:02:38
%S A304114 1,2,2,3,3,4,5,6,2,5,3,7,5,8,2,9,9,10,4,11,11,2,2,6,12,7,13,12,14,2,
%T A304114 15,11,16,9,17,6,18,9,19,3,20,10,2,21,12,22,17,23,20,24,2,25,17,26,15,
%U A304114 27,8,28,27,29,2,2,30,30,31,13,32,5,33,6,34,11,35,12,36,7,37,19,2,38,29,39,22,40,37,41,2,2,42,42,43,16,44,4,45,20,46,27,47,21
%N A304114 Restricted growth sequence transform of A246277(A098550(n)), related to indices in the prime factorization of Yellowstone permutation.
%H A304114 Antti Karttunen, <a href="/A304114/b304114.txt">Table of n, a(n) for n = 1..65539</a>
%F A304114 For all i, j: a(i) = a(j) => A304115(i) = A304115(j).
%o A304114 (PARI)
%o A304114 \\ Needs also code for A098550:
%o A304114 A064989(n) = {my(f); f = factor(n); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f)};
%o A304114 A246277(n) = { if(1==n, 0, while((n%2), n = A064989(n)); (n/2)); };
%o A304114 Aux304114(n) = A246277(A098550(n));
%o A304114 write_to_bfile(start_offset,vec,bfilename) = { for(n=1, length(vec), write(bfilename, (n+start_offset)-1, " ", vec[n])); }
%o A304114 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 A304114 write_to_bfile(1,rgs_transform(vector(65539,n,Aux304114(n))),"b304114.txt");
%Y A304114 Cf. A098550, A246277, A304115.
%Y A304114 Cf. also A304112.
%K A304114 nonn
%O A304114 1,2
%A A304114 _Antti Karttunen_, May 17 2018