login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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

%I #8 Oct 08 2023 21:17:46

%S 0,1,1,1,1,5,1,1,1,1,5,11,1,13,1,3,1,17,1,19,5,1,11,23,1,25,13,27,1,

%T 29,3,1,1,11,17,5,1,37,19,39,5,41,1,43,11,3,23,47,1,7,25,51,13,53,27,

%U 11,1,19,29,59,3,61,1,63,1,65,11,67,17,23,5,71,1,73,37,3,19,77,39,79,5,3,41,83,1,17,43,87,11,89

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

%C Numerator of n / A332214(n).

%H Antti Karttunen, <a href="/A366374/b366374.txt">Table of n, a(n) for n = 0..8191</a>

%F a(n) = n / A366373(n) = n / gcd(n, A332214(n)).

%o (PARI) A366374(n) = (n/gcd(n,A332214(n)));

%Y Cf. A332214, A366372, A366373, A366375 (denominators), A366376.

%Y Cf. also A364491, A366284.

%K nonn,frac

%O 0,6

%A _Antti Karttunen_, Oct 08 2023