|
| |
|
|
A130779
|
|
a(0)=a(1)=1, a(2)=2, a(n)=0 for n >= 3.
|
|
5
| |
|
|
1, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| Inverse binomial transform of A002522. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 13 2008
Multiplicative with a(2)=2, a(2^e)=0 if e>1, a(p^e)=0 for odd prime p if e>=1. Dirichlet g.f. 1+2^(1-s). - R. J. Mathar, Jun 28 2011
|
|
|
LINKS
| Index to sequences with linear recurrences with constant coefficients
|
|
|
FORMULA
| G.F.:1+x+2x^2
a(n)=[C((n+2)^2,n+4) mod 2]+[C((n+1)^2,n+3) mod 2]+2*[C(n^2,n+2) mod 2] - Paolo P. Lava (paoloplava(AT)gmail.com), Dec 19 2007
|
|
|
PROG
| (PARI) a(n)=if(n<3, max(n, 1), 0) \\ Charles R Greathouse IV, Dec 21 2011
|
|
|
CROSSREFS
| Cf. A130706.
Sequence in context: A083919 A063665 A072507 * A130706 A000038 A063667
Adjacent sequences: A130776 A130777 A130778 * A130780 A130781 A130782
|
|
|
KEYWORD
| nonn,mult,easy
|
|
|
AUTHOR
| Paul Curtz, Jul 14 2007
|
|
|
EXTENSIONS
| Terms added by Michael Porter (michael_b_porter(AT)yahoo.com), Nov 05 2009
|
| |
|
|
