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.

A354987 a(n) = A344005(n) / gcd(A047994(n), A344005(n)).

This page as a plain text file.
%I A354987 #14 Jun 16 2022 21:19:00
%S A354987 1,1,1,1,1,1,1,1,1,1,1,1,1,1,5,1,1,1,1,1,1,1,1,4,1,1,1,7,1,5,1,1,11,1,
%T A354987 7,1,1,1,1,15,1,1,1,11,9,1,1,1,1,1,17,1,1,1,1,1,1,1,1,5,1,1,9,1,25,11,
%U A354987 1,1,23,7,1,1,1,1,1,19,7,1,1,1,1,1,1,5,17,1,29,16,1,9,13,23,1,1,19,16,1,1,11,1,1,17
%N A354987 a(n) = A344005(n) / gcd(A047994(n), A344005(n)).
%C A354987 Denominator of fraction A047994(n) / A344005(n).
%H A354987 Antti Karttunen, <a href="/A354987/b354987.txt">Table of n, a(n) for n = 1..20000</a>
%H A354987 Antti Karttunen, <a href="/A354987/a354987.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%F A354987 a(n) = A344005(n) / A354985(n) = A344005(n) / gcd(A047994(n), A344005(n)).
%t A354987 s[n_] := Module[{m = 1}, While[!Divisible[m*(m + 1), n], m++]; m]; f[p_, e_] := p^e - 1; uphi[n_] := Times @@ f @@@ FactorInteger[n]; uphi[1] = 1; a[n_] := Denominator[uphi[n]/s[n]]; Array[a, 100] (* _Amiram Eldar_, Jun 16 2022 *)
%o A354987 (PARI)
%o A354987 A047994(n) = { my(f=factor(n)~); prod(i=1, #f, (f[1, i]^f[2, i])-1); };
%o A354987 A344005(n) = for(m=1, oo, if((m*(m+1))%n==0, return(m))); \\ From A344005
%o A354987 A354987(n) = { my(u=A344005(n)); (u/gcd(u, A047994(n))); };
%Y A354987 Cf. A047994, A344005, A346607, A354985, A354986 (numerators).
%Y A354987 Cf. also A345998, A345999.
%K A354987 nonn,frac
%O A354987 1,15
%A A354987 _Antti Karttunen_, Jun 16 2022