|
| |
|
|
A029578
|
|
An obvious mixture of two sequences.
|
|
12
| |
|
|
0, 0, 1, 2, 2, 4, 3, 6, 4, 8, 5, 10, 6, 12, 7, 14, 8, 16, 9, 18, 10, 20, 11, 22, 12, 24, 13, 26, 14, 28, 15, 30, 16, 32, 17, 34, 18, 36, 19, 38, 20, 40, 21, 42, 22, 44, 23, 46, 24, 48, 25, 50, 26, 52, 27, 54, 28, 56, 29, 58, 30, 60, 31, 62, 32, 64, 33, 66, 34, 68, 35, 70, 36, 72
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,4
|
|
|
COMMENTS
| a(n) = number of ordered, length two, compositions of n with at least one odd summand - Len Smiley (smiley(AT)math.uaa.alaska.edu), Nov 25 2001
Also number of 0's in n-th row of triangle in A071037. - Hans Havermann (gladhobo(AT)teksavvy.com), May 26 2002
a(n) = (n - n mod 2)/(2 - n mod 2). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 30 2002
|
|
|
LINKS
| Index entries for two-way infinite sequences
Index to sequences with linear recurrences with constant coefficients, signature (0,2,0,-1).
|
|
|
FORMULA
| a(n) = (3*n/2-1+(1-n/2)*(-1)^n)/2. a(n+4)=2*a(n+2)-a(n).
G.f.: x^2*(2x+1)/(1-x^2)^2; a(n)=floor((n+1)/2)+(n is odd)*floor((n+1)/2)
a(n)=floor(n/2)*binomial(2, mod(n, 2)) - Paul Barry (pbarry(AT)wit.ie), May 25 2003
a(2*n) = n, a(2*n-1) = 2*n-2. a(-n)=-A065423(n+2).
a(n)=sum{k=0..floor((n-2)/2), (C(n-k-2, k) mod 2)((1+(-1)^k)/2)*2^A000120(n-2k-2)} - Paul Barry (pbarry(AT)wit.ie), Jan 06 2005
a(n)=sum{k=0..n-2, gcd(n-k-1, k+1)} - Paul Barry (pbarry(AT)wit.ie), May 03 2005
For n>6: a(n)=floor(a(n-1)*a(n-2)/a(n-3)). [Reinhard Zumkeller, Mar 06 2011]
|
|
|
PROG
| (PARI) a(n)=if(n%2, n-1, n/2)
|
|
|
CROSSREFS
| Cf. A065423 (at least one even summand).
Cf. A009531.
Sequence in context: A202479 A161660 A060766 * A054345 A060367 A062968
Adjacent sequences: A029575 A029576 A029577 * A029579 A029580 A029581
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
