|
Search: id:A052531
|
|
|
| A052531 |
|
If n is even then 2^n+1 otherwise 2^n. |
|
+0
1
|
|
| 2, 2, 5, 8, 17, 32, 65, 128, 257, 512, 1025, 2048, 4097, 8192, 16385, 32768, 65537, 131072, 262145, 524288, 1048577, 2097152, 4194305, 8388608, 16777217, 33554432, 67108865, 134217728, 268435457, 536870912, 1073741825, 2147483648
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
A simple regular expression.
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 461
|
|
FORMULA
|
G.f.: -(-2+x^2+2*x)/(-1+2*x)/(-1+x^2).
Recurrence: {a(1)=2, a(2)=5, a(0)=2, -2*a(n)-a(n+1)+a(n+2)+1}
2^n+Sum(1/2*_alpha^(-n), _alpha=RootOf(-1+_Z^2))
|
|
MAPLE
|
spec := [S, {S=Union(Sequence(Union(Z, Z)), Sequence(Prod(Z, Z)))}, unlabeled]: seq(combstruct[count](spec, size=n), n=0..20);
|
|
MATHEMATICA
|
2^# + (1 - Mod[ #, 2]) & /@ Range[0, 31] - from Peter Pein
|
|
CROSSREFS
|
Sequence in context: A006367 A077902 A005834 this_sequence A095005 A019086 A076949
Adjacent sequences: A052528 A052529 A052530 this_sequence A052532 A052533 A052534
|
|
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
Better definition from Peter Pein (petsie(AT)dordos.net), Jan 11 2008
|
|
|
Search completed in 0.002 seconds
|
