|
Search: id:A113861
|
|
|
| A113861 |
|
(1/9)*((6*n-7)*2^(n-1)+(-1)^(n-1)). |
|
+0
4
|
|
| 0, 1, 5, 15, 41, 103, 249, 583, 1337, 3015, 6713, 14791, 32313, 70087, 151097, 324039, 691769, 1470919, 3116601, 6582727, 13864505, 29127111, 61050425, 127693255, 266571321, 555512263, 1155763769, 2401006023, 4980969017, 10319851975, 21355531833, 44142719431
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
T. Etzion, On the stopping redundancy of Reed-Muller codes, IEEE Trans. Information Theory, submitted (2005); arXiv:cs.IT/0511056.
|
|
FORMULA
|
a(n+1)-2a(n)= A001045(n+2), Jacobsthal numbers. - Paul Curtz (bpcrtz(AT)free.fr), Jul 05 2008
3a(n)-a(n+1)= -1, -2, 4*a(n). - Paul Curtz (bpcrtz(AT)free.fr), Jul 05 2008
|
|
CROSSREFS
|
Cf. A102301.
Adjacent sequences: A113858 A113859 A113860 this_sequence A113862 A113863 A113864
Sequence in context: A000333 A054888 A038066 this_sequence A080870 A102620 A053731
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Jan 25 2006
|
|
|
Search completed in 0.002 seconds
|
