|
Search: id:A005061
|
|
| |
|
| 0, 1, 7, 37, 175, 781, 3367, 14197, 58975, 242461, 989527, 4017157, 16245775, 65514541, 263652487, 1059392917, 4251920575, 17050729021, 68332056247, 273715645477, 1096024843375, 4387586157901, 17560804984807
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Number of 2 X n binary arrays with a path of adjacent 1's from top row to bottom row. - Ron Hardin (rhh(AT)cadence.com), Mar 21 2002
|
|
REFERENCES
|
V. Jovovic, G. Kilibarda, On the number of Boolean functions in the Post classes F^{mu}_8, Diskretnaya Matematika, 11 (1999), no. 4, 127-138 (translated in Discrete Mathematics and Applications, 9, (1999), no. 6).
|
|
LINKS
|
X. Acloque, Polynexus Numbers and other mathematical wonders.
|
|
FORMULA
|
a(n) = 4*a(n-1) + 3^(n-1) - Xavier Acloque Oct 20 2003
Binomial transform of A001047. - Ross La Haye (rlahaye(AT)new.rr.com), Sep 17 2005
|
|
MAPLE
|
a:=n->sum(3^(n-j)*binomial(n, j), j=1..n): seq(a(n), n=0..22); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jan 04 2007
|
|
CROSSREFS
|
Sequence in context: A085720 A049494 A049495 this_sequence A099454 A125317 A006419
Adjacent sequences: A005058 A005059 A005060 this_sequence A005062 A005063 A005064
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
