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.

A319345 Filter sequence combining the prime signature of phi(d) from all divisors d > 1 of n.

This page as a plain text file.
%I A319345 #5 Sep 17 2018 15:45:48
%S A319345 1,2,3,4,5,6,7,8,9,10,7,11,12,13,14,15,16,17,12,18,19,13,7,20,21,22,
%T A319345 19,23,12,24,25,26,19,27,28,29,30,22,31,32,33,34,25,23,35,13,7,36,37,
%U A319345 38,39,40,12,34,28,41,42,22,7,43,44,45,46,47,48,34,25,49,19,50,25,51,52,53,54,55,56,57,25,58,59,60,7,61,62,45,31,41,33,63,64,23,65,13
%N A319345 Filter sequence combining the prime signature of phi(d) from all divisors d > 1 of n.
%C A319345 Restricted growth sequence transform of A319344.
%H A319345 Antti Karttunen, <a href="/A319345/b319345.txt">Table of n, a(n) for n = 1..65537</a>
%o A319345 (PARI)
%o A319345 up_to = 65537;
%o A319345 A319344(n) = { my(m=1); fordiv(n, d, if((d>1), m *= prime(A318881(d)))); (m); }; \\ Needs also code from A318881
%o A319345 v319345 = rgs_transform(vector(up_to,n,A319344(n)));
%o A319345 A319345(n) = v319345[n];
%Y A319345 Cf. A318881, A319343, A319344.
%Y A319345 Cf. also A305985.
%K A319345 nonn
%O A319345 1,2
%A A319345 _Antti Karttunen_, Sep 17 2018