cp's OEIS Frontend

A366373 a(n) = gcd(n, A332214(n)), where A332214 is the Mersenne-prime fixing variant of permutation A163511.

%I A366373 #10 Oct 08 2023 21:17:42
%S A366373 1,1,2,3,4,1,6,7,8,9,2,1,12,1,14,5,16,1,18,1,4,21,2,1,24,1,2,1,28,1,
%T A366373 10,31,32,3,2,7,36,1,2,1,8,1,42,1,4,15,2,1,48,7,2,1,4,1,2,5,56,3,2,1,
%U A366373 20,1,62,1,64,1,6,1,4,3,14,1,72,1,2,25,4,1,2,1,16,27,2,1,84,5,2,1,8,1,30,7,4,93,2,1,96
%N A366373 a(n) = gcd(n, A332214(n)), where A332214 is the Mersenne-prime fixing variant of permutation A163511.
%H A366373 Antti Karttunen, <a href="/A366373/b366373.txt">Table of n, a(n) for n = 0..8191</a>
%F A366373 a(n) = gcd(n, A366372(n)) = gcd(A332214(n), A366372(n)).
%F A366373 For n >= 1, a(n) = n / A366374(n)
%F A366373 a(n) = A332214(n) / A366375(n).
%o A366373 (PARI) A366373(n) = gcd(n,A332214(n));
%Y A366373 Cf. A332214, A366372, A366374, A366375, A366376.
%Y A366373 Cf. also A364254, A364255, A366283.
%K A366373 nonn
%O A366373 0,3
%A A366373 _Antti Karttunen_, Oct 08 2023