|
%I #35 Jan 28 2017 14:44:04
%S 0,1,1,3,0,5,0,7,1,9,0,5,0,7,5,15,0,11,0,9,1,11,0,13,0,13,19,7,0,19,0,
%T 31,11,17,0,11,0,19,13,13,0,37,0,33,35,23,0,37,0,39,34,39,0,11,5,35,
%U 19,29,0,29,0,31,61,63,0,55,0,51,23,21,0,43,0,37,50,19
%N (Numerator of Bernoulli(2*n)) read mod n.
%C Conjecture: a(n) == n-1 (mod n) if only if n = 6, 10 or n = 2^k for k >= 0. This is true for n <= 1024. - _Seiichi Manyama_, Jan 27 2017
%H Seiichi Manyama, <a href="/A281648/b281648.txt">Table of n, a(n) for n = 1..1000</a>
%F a(n) = A000367(n) mod n.
%t f[n_] := Mod[Numerator[BernoulliB[2 n]], n]; Array[f, 77] (* _Robert G. Wilson v_, Jan 26 2017 *)
%o (Ruby)
%o def bernoulli(n)
%o ary = []
%o a = []
%o (0..n).each{|i|
%o a << 1r / (i + 1)
%o i.downto(1){|j| a[j - 1] = j * (a[j - 1] - a[j])}
%o ary << a[0]
%o }
%o ary
%o end
%o def A281648(n)
%o a = bernoulli(2 * n)
%o (1..n).map{|i| a[2 * i].numerator % i}
%o end
%o (PARI) a(n)=numerator(bernfrac(2*n))%n \\ _Charles R Greathouse IV_, Jan 27 2017
%Y Cf. A000367, A060976, A069040, A070192, A070193, A281662.
%K nonn
%O 1,4
%A _Seiichi Manyama_, Jan 26 2017
|
