|
Search: id:A166926
|
|
| |
|
| 1, 2, 4, 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; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Inverse binomial transform of A058331.
|
|
FORMULA
|
a(0) = 1, a(1) = 2, a(2) = 4, a(n) = 0 for n > 2.
G.f.: (1+2*x+4*x^2).
a(n)=1-[(n+2) mod (n+1)]+2*{C[(n+1)^2,n+3] mod 2}+4*{binomial[(n+12)^4,n+14] mod 2}, with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Nov 02 2009]
|
|
PROGRAM
|
(PARI) {concat([1, 2, 4], vector(102))}
|
|
CROSSREFS
|
Cf. A000004 (zero sequence), A058331 (2*n^2+1), A130706 (1, 2, 0, 0, 0, 0, ...), A130779 (1, 1, 2, 0, 0, 0, 0, ...).
Sequence in context: A120313 A082871 A139627 this_sequence A028573 A138758 A107501
Adjacent sequences: A166923 A166924 A166925 this_sequence A166927 A166928 A166929
|
|
KEYWORD
|
easy,nonn,new
|
|
AUTHOR
|
Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Oct 23 2009
|
|
|
Search completed in 0.002 seconds
|
