|
Search: id:A051926
|
|
|
| A051926 |
|
Number of independent sets of nodes in graph C_4 x P_n (n>2). |
|
+0
1
|
|
| 1, 7, 35, 181, 933, 4811, 24807, 127913, 659561, 3400911, 17536203, 90422365, 466247117, 2404121747, 12396433487, 63920042065, 329592522065, 1699486218903, 8763103574515, 45185411569413, 232990675202677
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Number of ways zero or more black and white stones can be placed on the points of a 2 X n grid such that no white stones are adjacent to any black stones. A078057 is a related case, where the grid is 1 X n. - Wayne VanWeerthuizen (waynemv(AT)yahoo.com), May 04 2004
|
|
FORMULA
|
a[0]=1, a[n]=5*a[n-1]+a[n-2]-a[n-3]. - Wayne VanWeerthuizen (waynemv(AT)yahoo.com), May 04 2004
a(n) = a(n-1) + 17*a(n-2) + 23*a(n-3) + a(n-4) - 9*a(n-5) - a(n-6) + a(n-7)
|
|
CROSSREFS
|
Sequence in context: A005055 A037506 A037689 this_sequence A026128 A026157 A025184
Adjacent sequences: A051923 A051924 A051925 this_sequence A051927 A051928 A051929
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Stephen G. Penrice (spenrice(AT)ets.org), Dec 19 1999
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Dec 20 1999
|
|
|
Search completed in 0.002 seconds
|
