|
Search: id:A027656
|
|
|
| A027656 |
|
Expansion of 1/(1-x^2)^2 (included only for completeness - my policy is always to omit the zeros from such sequences). |
|
+0
21
|
|
| 1, 0, 2, 0, 3, 0, 4, 0, 5, 0, 6, 0, 7, 0, 8, 0, 9, 0, 10, 0, 11, 0, 12, 0, 13, 0, 14, 0, 15, 0, 16, 0, 17, 0, 18, 0, 19, 0, 20, 0, 21, 0, 22, 0, 23, 0, 24, 0, 25, 0, 26, 0, 27, 0, 28, 0, 29, 0, 30, 0, 31, 0, 32, 0, 33, 0, 34, 0, 35, 0, 36, 0, 37, 0, 38, 0, 39, 0, 40, 0, 41, 0, 42, 0, 43, 0
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
a(n) = (n+2)(n+3)/2 mod n+2. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 17 2004
|
|
FORMULA
|
Binomial transform is A045891. Partial sums are A008805. The sequence 0, 1, 0, 2, ... has a(n)=floor((n+2)/2)(1-(-1)^n)/2. - Paul Barry (pbarry(AT)wit.ie), May 27 2003
a(n)=floor((n+3)/2)(1+(-1)^n)/2 - Paul Barry (pbarry(AT)wit.ie), May 27 2003
a(n)={[1+(-1)^n]/4}*Sum_{k=0..n}{1+(-1)^k} - Paolo P. Lava (ppl(AT)spl.at), Nov 30 2007
|
|
CROSSREFS
|
Cf. A142150. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 05 2009]
Sequence in context: A108416 A108760 A137304 this_sequence A142150 A034948 A135472
Adjacent sequences: A027653 A027654 A027655 this_sequence A027657 A027658 A027659
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
