|
Search: id:A006367
|
|
|
| A006367 |
|
Number of binary vectors beginning with 0 and containing just 1 singleton. |
|
+0
3
|
|
| 1, 0, 2, 2, 5, 8, 15, 26, 46, 80, 139, 240, 413, 708, 1210, 2062, 3505, 5944, 10059, 16990, 28646, 48220, 81047, 136032, 228025, 381768, 638450, 1066586, 1780061, 2968040, 4944519, 8230370, 13689118, 22751528, 37786915, 62716752, 104028245
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Number of compositions of n+1 containing exactly one 1. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 08 2002
Number of permutations with one fixed point avoiding 231 and 321.
|
|
LINKS
|
T. Mansour and A. Robertson, Refined restricted permutations....
|
|
FORMULA
|
a(n)=a(n-1)+a(n-2)+Fibonacci(n-3).
G.f.: (1-x)^2/(1-x-x^2)^2 - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 08 2002
|
|
EXAMPLE
|
a(4)=5 because among the 2^4 compositions of 5 only 4+1,1+4,2+2+1,2+1+2,1+2+2 contain exactly one 1.
|
|
CROSSREFS
|
Sequence in context: A056224 A052527 A042982 this_sequence A077902 A005834 A052531
Adjacent sequences: A006364 A006365 A006366 this_sequence A006368 A006369 A006370
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
David M. Bloom.
|
|
EXTENSIONS
|
More terms from Erich Friedman (erich.friedman(AT)stetson.edu).
|
|
|
Search completed in 0.002 seconds
|
