|
Search: id:A052552
|
|
|
| A052552 |
|
a(2n+1) = 1, a(2n) = 2*a(2n-2)-1. |
|
+0
1
|
|
| 2, 1, 3, 1, 5, 1, 9, 1, 17, 1, 33, 1, 65, 1, 129, 1, 257, 1, 513, 1, 1025, 1, 2049, 1, 4097, 1, 8193, 1, 16385, 1, 32769, 1, 65537, 1, 131073, 1, 262145, 1, 524289, 1, 1048577, 1, 2097153, 1, 4194305, 1, 8388609, 1, 16777217, 1, 33554433, 1, 67108865, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 489
|
|
FORMULA
|
G.f.: -(-2+x+2*x^2)/(-1+2*x^2)/(-1+x)
Recurrence: {a(1)=1, a(2)=3, a(0)=2, -2*a(n)+1+a(n+2)}
1+Sum(1/2*_alpha^(-n), _alpha=RootOf(-1+2*_Z^2))
|
|
MAPLE
|
spec := [S, {S=Union(Sequence(Prod(Z, Union(Z, Z))), Sequence(Z))}, unlabeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
CROSSREFS
|
Sequence in context: A127203 A126132 A129982 this_sequence A147000 A147486 A085053
Adjacent sequences: A052549 A052550 A052551 this_sequence A052553 A052554 A052555
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jun 05 2000
|
|
|
Search completed in 0.011 seconds
|
