|
Search: id:A088560
|
|
|
| A088560 |
|
Sum of odd entries in row n of Pascal's triangle. |
|
+0
2
|
|
| 1, 2, 2, 8, 2, 12, 32, 128, 2, 20, 92, 464, 992, 4032, 8192, 32768, 2, 36, 308, 2320, 9692, 52712, 164320, 781312, 1470944, 6249152, 13748672, 56768768, 67100672, 268419072, 536870912, 2147483648, 2, 68, 1124, 14352, 117812, 1003960, 5670400
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(n) = a power of 2 iff n = 2^k - 2, 2^k - 1 or 2^k.
A088560(n) = A088504(n) iff n = 2^k - 2, k>1. A088560(n) > A088504(n) iff n = 2^k - 1.
|
|
FORMULA
|
A088560(n) + A088504(n) = 2^n. A088504(n) - A088560(n) = A085814(n).
a(2^n)=2; a(2^n-1)=2^(2^n-1); a(2^n+1)=2^(n+1)+4 ... - Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 19 2003
|
|
MATHEMATICA
|
f[n_] := Plus @@ Select[ Table[ Binomial[n, i], {i, 0, n}], OddQ[ # ] & ]; Table[ f[n], {n, 0, 38}] (from Robert G. Wilson v Nov 19 2003)
|
|
PROGRAM
|
(PARI) a(n)=sum(i=0, n, binomial(n, i)*(binomial(n, i)%2))
|
|
CROSSREFS
|
Cf. A001316.
Adjacent sequences: A088557 A088558 A088559 this_sequence A088561 A088562 A088563
Sequence in context: A098818 A092694 A098984 this_sequence A086328 A095997 A056189
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Yuval Dekel (dekelyuval(AT)hotmail.com), Nov 17 2003
|
|
EXTENSIONS
|
Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com) and Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 19 2003
|
|
|
Search completed in 0.002 seconds
|
