cp's OEIS Frontend

A323070 Numbers k such that A055023(k) != A323071(k), where A323071(k) = gcd(k, 1+A060681(k)).

%I A323070 #15 Jul 17 2021 13:31:20
%S A323070 55,105,155,203,253,355,405,455,497,595,655,689,705,737,755,791,955,
%T A323070 979,1005,1027,1055,1081,1221,1255,1305,1355,1379,1555,1605,1655,1673,
%U A323070 1703,1711,1751,1855,1905,1955,1967,2065,2155,2189,2205,2255,2261,2329,2455,2505,2555,2755,2805,2849,2855,3055
%N A323070 Numbers k such that A055023(k) != A323071(k), where A323071(k) = gcd(k, 1+A060681(k)).
%C A323070 Equivalently, numbers k for which A055032(k) != A323072(k).
%C A323070 Neither primes nor prime powers present?
%o A323070 (PARI)
%o A323070 A055023(n) = (n/denominator((sum(m=1, n - 1, m^(n - 1)) + 1)/n)); \\ From A055023.
%o A323070 A060681(n) = (n-if(1==n,n,n/vecmin(factor(n)[,1])));
%o A323070 A323071(n) = gcd(n,1+A060681(n));
%o A323070 is_A323070(n) = (A055023(n)!=A323071(n));
%Y A323070 Cf. A055023, A055032, A060681, A323071, A323072.
%K A323070 nonn
%O A323070 1,1
%A A323070 _Antti Karttunen_, Jan 04 2019