|
%I #15 Dec 01 2020 20:54:10
%S 1,1,2,1,6,1,4,3,10,1,12,1,14,75,8,1,18,1,4,21,22,1,24,5,26,9,196,1,
%T 30,1,16,33,34,5,36,1,38,39,40,1,42,1,44,45,46,1,48,7,50,51,52,1,54,
%U 55,56,57,58,1,60,1,62,63,32,65,66,1,68,69,70,1,72,1,74,375,76,847
%N Ratios of consecutive terms of A334958.
%C Conjecture: a(n) = 1 if and only if n+1 is prime.
%F a(n) = A334958(n+1)/A334958(n).
%p b:= proc(n) b(n):= (-(-1)^n/n +`if`(n=1, 0, b(n-1))) end:
%p g:= proc(n) g(n):= (f-> igcd(b(n)*f, f))(n!) end:
%p a:= n-> g(n+1)/g(n):
%p seq(a(n), n=1..80); # _Alois P. Heinz_, May 20 2020
%t b[n_] := b[n] = -(-1)^n/n + If[n==1, 0, b[n-1]];
%t g[n_] := GCD[b[n] #, #]&[n!];
%t a[n_] := g[n+1]/g[n];
%t Array[a, 80] (* _Jean-François Alcover_, Nov 30 2020, after _Alois P. Heinz_ *)
%o (PARI) f(n) = n!*sum(k=2, n, (-1)^k/k); \\ A024168
%o g(n) = gcd(f(n+1), f(n)); \\ A334958
%o a(n) = g(n+1)/g(n); \\ _Michel Marcus_, May 20 2020
%Y Cf. A056612, A334958.
%K nonn
%O 1,3
%A _Petros Hadjicostas_, May 19 2020
|
