OFFSET
1,2
COMMENTS
This is, more explicitly, the number of positive integers of the form C(n+1,i)*B(i) where B(i) is the i-th Bernoulli number and C(n,k) is the binomial coefficient (k -sets from n distinct elements). The floor((n-1)/2) zero cases are excluded from this sequence. - Olivier Gérard, Oct 19 2005
REFERENCES
R. L. Graham et al., Concrete Math., Chapter 6.5, Bernoulli numbers
EXAMPLE
B(5,x)=x^5 - (5/2)*x^4 +( 5/3)*x^3 +0*x^2- (1/6)*x+0 hence a(5)=1
MATHEMATICA
Table[Count[ DeleteCases[ Table[Binomial[j + 1, i]*BernoulliB[ i], {i, 0, j}], 0], _Integer], {j, 0, 200}] (Gerard)
PROG
(PARI) B(n, x)=sum(i=0, n, binomial(n, i)*bernfrac(i)*x^(n-i)); a(n)=sum(i=0, n, if(frac(polcoeff(B(n, x), i)), 0, 1))-floor((n-1)/2)
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jun 19 2004
STATUS
approved