|
%I #16 Jun 24 2023 06:36:50
%S 1,1,1,1,1,5,1,7,1,1,1,11,1,13,7,5,1,17,1,19,1,1,11,23,1,25,13,1,7,29,
%T 1,31,1,11,629,35,1,37,19,13,1,41,1,43,11,5,23,47,1,49,1,1003,481,53,
%U 1,5,7,19,29,59,1,61,2077,103,1,65,11,67,17,23,259,71,1,73,37,25,2489,77
%N a(n) = A000367(n)/A141590(n).
%H Jeppe Stig Nielsen, <a href="/A111008/b111008.txt">Table of n, a(n) for n = 0..10000</a>
%p A120082 := proc(n) local b; if n = 0 then b := 1 ; elif n = 1 then b := -1/4 ; elif type(n,'odd') then b := 0; else b := bernoulli(n)/(n+1)! ; fi; numer(b) ; end:
%p A141590 := proc(n) A120082(2*n) ; end: A000367 := proc(n) numer(bernoulli(2*n)) ; end:
%p A111008 := proc(n) A000367(n)/A141590(n) ; end: seq(A111008(n),n=0..120) ; # _R. J. Mathar_, Sep 03 2009
%o (PARI) upto(N)=bernvec(N);forstep(n=0,2*N,2,print1(gcd(numerator(bernfrac(n)), (n+1)!),", ")) \\ _Jeppe Stig Nielsen_, Jun 22 2023
%Y See A141517.
%Y Cf. A300711.
%K nonn
%O 0,6
%A _Paul Curtz_, Aug 25 2008
%E Edited and extended by _R. J. Mathar_, Sep 03 2009
|
