A176184 a(2n) = A027641(n). a(2n+1) = A164555(n).

1, 1, -1, 1, 1, 1, 0, 0, -1, -1, 0, 0, 1, 1, 0, 0, -1, -1, 0, 0, 5, 5, 0, 0, -691, -691, 0, 0, 7, 7, 0, 0, -3617, -3617, 0, 0

Offset

0,21

Comments

Essentially the same as A176144. (The signs of the third and fourth entry are swapped.)

This refers to a shuffling of the "original" Bernoulli numbers and the Bernoulli numbers in opposite order compared to the composition discussed in A176150.

The inverse binomial transform of the shuffle in A176150 was 1,0, -1/2, 0, 13/6, -20/3. The shuffling here would yield an inverse binomial transform 1, 0, -3/2, 4, -47/6, 40/3, -21, 95/3 etc.

The difference between the corresponding elements of these two binomial transforms element by element is 0, 0, 1, -4, 10, -20, 35, -56, 84, -120, 165, -220,..., a signed variant of A000292.

Links

Table of n, a(n) for n=0..35.

Crossrefs

Sequence in context: A282481 A286979 A030047 * A176144 A308356 A065936

Adjacent sequences: A176181 A176182 A176183 * A176185 A176186 A176187

Keyword

frac,less,sign

Author

Paul Curtz, Apr 11 2010

Status

approved