A090863 - cp's OEIS frontend

A090863 Numbers n such that F(n+1)F(n-1)B(2n) is an integer, where F(k)=k-th Fibonacci number and B(2k)=2k-th Bernoulli number.

%I A090863 #6 Mar 30 2012 18:39:22
%S A090863 1,7,13,17,19,31,37,43,47,49,59,61,67,71,73,79,91,97,101,103,107,109,
%T A090863 121,127,133,137,139,143,149,151,157,161,163,167,169,181,193,197,199,
%U A090863 211,217,223,227,229,241,247,257,259,263,269,271,277,283,289
%N A090863 Numbers n such that F(n+1)*F(n-1)*B(2n) is an integer, where F(k)=k-th Fibonacci number and B(2k)=2k-th Bernoulli number.
%C A090863 Differs from A045979 for some terms. Contains A053176.
%K A090863 nonn
%O A090863 1,2
%A A090863 _Benoit Cloitre_, Feb 12 2004

cp's OEIS Frontend

A090863 Numbers n such that F(n+1)*F(n-1)*B(2n) is an integer, where F(k)=k-th Fibonacci number and B(2k)=2k-th Bernoulli number.

A090863 Numbers n such that F(n+1)F(n-1)B(2n) is an integer, where F(k)=k-th Fibonacci number and B(2k)=2k-th Bernoulli number.