|
| |
|
|
A100063
|
|
A Chebyshev transform of Jacobsthal numbers.
|
|
5
| |
|
|
1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,4
|
|
|
COMMENTS
| A Chebyshev transform of A001045(n+1): if A(x) is the g.f. of a sequence, map it to ((1-x^2)/(1+x^2))A(x/(1+x^2)).
Multiplicative with a(3^e) = 2, a(p^e) = 1 otherwise. David W. Wilson (davidwwilson(AT)comcast.net) Jun 11, 2005.
|
|
|
FORMULA
| G.f.: (1+x)(1+x^2)/(1-x^3); a(n)=n*sum{k=0..floor(n/2), binomial(n-k, k)(-1)^k*A001045(n-2k+1)/(n-k).
Dirichlet g.f. zeta(s)*(1+1/3^s). Dirichlet convolution of A154272 and A000012. - R. J. Mathar, Feb 07 2011
|
|
|
CROSSREFS
| Cf. A100051, A061347, A057079.
Sequence in context: A099837 A100051 A122876 * A057079 A132419 A131556
Adjacent sequences: A100060 A100061 A100062 * A100064 A100065 A100066
|
|
|
KEYWORD
| easy,nonn,mult
|
|
|
AUTHOR
| Paul Barry (pbarry(AT)wit.ie), Nov 02 2004
|
| |
|
|
