|
Search: id:A008598
|
|
| |
|
| 0, 16, 32, 48, 64, 80, 96, 112, 128, 144, 160, 176, 192, 208, 224, 240, 256, 272, 288, 304, 320, 336, 352, 368, 384, 400, 416, 432, 448, 464, 480, 496, 512, 528, 544, 560, 576, 592, 608, 624, 640
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
If X is an n-set and Y_i (i=1,2,3,4) mutually disjoint 2-subsets of X then a(n-6) is equal to the number of 5-subests of X intersecting each Y_i (i=1,2,3,4). - Milan R. Janjic (agnus(AT)blic.net), Aug 26 2007
|
|
LINKS
|
Milan Janjic, Two Enumerative Functions
Tanya Khovanova, Recursive Sequences
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 328
|
|
MAPLE
|
with(numtheory):a:=proc(n) if n=0 then 0 else mcombine(11*n, 5*n, 3*n, 7*n) fi end: seq(a(n), n=0..40); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 11 2008
with(finance):seq(add(cashflows([8, 8, 4], 0 ), k=1..n), n=0..40); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 21 2008
|
|
CROSSREFS
|
Sequence in context: A046101 A044856 A044901 this_sequence A044061 A033028 A044841
Adjacent sequences: A008595 A008596 A008597 this_sequence A008599 A008600 A008601
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
