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.

A318881 Restricted growth sequence transform of A277906, the least number with same prime signature as phi(n).

This page as a plain text file.
%I A318881 #6 Sep 17 2018 15:45:18
%S A318881 1,1,2,2,3,2,4,3,4,3,4,3,5,4,6,6,7,4,5,6,5,4,4,6,5,5,5,5,5,6,8,7,5,7,
%T A318881 9,5,10,5,9,7,9,5,8,5,9,4,4,7,8,5,11,9,5,5,9,9,10,5,4,7,12,8,10,11,13,
%U A318881 5,8,11,5,9,8,9,14,10,9,10,12,9,8,11,9,9,4,9,15,8,9,9,9,9,14,5,12,4,14,11,16,8,12,9,10,11,8,13,13
%N A318881 Restricted growth sequence transform of A277906, the least number with same prime signature as phi(n).
%H A318881 Antti Karttunen, <a href="/A318881/b318881.txt">Table of n, a(n) for n = 1..65537</a>
%o A318881 (PARI)
%o A318881 up_to = 65537;
%o A318881 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 A318881 A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); }; \\ From A046523
%o A318881 A277906(n) = A046523(eulerphi(n));
%o A318881 v318881 = rgs_transform(vector(up_to,n,A277906(n)));
%o A318881 A318881(n) = v318881[n];
%Y A318881 Cf. A000010, A046523, A277906, A319342, A319343, A319344, A319345.
%K A318881 nonn
%O A318881 1,3
%A A318881 _Antti Karttunen_, Sep 17 2018