|
Search: id:A102301
|
|
|
| A102301 |
|
a(n) = ((3n+1)*2^(n+3) + 9 + (-1)^n)/18. |
|
+0
5
|
|
| 1, 4, 13, 36, 93, 228, 541, 1252, 2845, 6372, 14109, 30948, 67357, 145636, 313117, 669924, 1427229, 3029220, 6407965, 13514980, 28428061, 59652324, 124897053, 260978916, 544327453, 1133394148, 2356266781, 4891490532, 10140895005
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
A floretion-generated sequence resulting from particular transform of A000975.
|
|
REFERENCES
|
T. Etzion, On the stopping redundancy of Reed-Muller codes, IEEE Trans. Information Theory, submitted (2005); arXiv:cs.IT/0511056.
|
|
FORMULA
|
G.f. 1/((x+1)(1-x)(2x-1)^2); a(n+1) - 2a(n) = A000975(n+2) (n-th number without consecutive equal binary digits) a(n) + a(n+1) = A000337(n+2); a(n+1) - a(n) = A045883(n+2); a(n+2) - a(n) = A001787(n+3) ( Number of edges in n-dimensional hypercube ); a(n+2) - 2*a(n+1) + a(n) = A059570(n+3);
Convolution of "Number of fixed points in all 231-avoiding involutions in S_n" (A059570) with the natural numbers (A000027), treating the result as if offset=0. - Graeme McRae (g_m(AT)mcraefamily.com), Jul 12 2006
|
|
PROGRAM
|
Floretion Algebra Multiplication Program, FAMP Code: 2jesforseq[ + .5'i + 'kk' + .5'jk' ], 1vesforseq(n) = A000975(n+2)*(-1)^(n+1), ForType: 1A, LoopType: tes (2nd iteration)
|
|
CROSSREFS
|
Cf. A000975, A000337, A045883, A001787, A059570.
Cf. A000975, A137266.
Sequence in context: A036636 A036643 A000299 this_sequence A031506 A065297 A067635
Adjacent sequences: A102298 A102299 A102300 this_sequence A102302 A102303 A102304
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Feb 20 2005
|
|
|
Search completed in 0.002 seconds
|
