|
| |
|
|
A008598
|
|
Multiples of 16.
|
|
16
| |
|
|
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, 656, 672, 688, 704, 720, 736, 752, 768, 784, 800, 816, 832
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| 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
|
|
|
MATHEMATICA
| Range[0, 1000, 16] (* From Vladimir Joseph Stephan Orlovsky (4vladimir(AT)gmail.com), May 31 2011 *)
|
|
|
CROSSREFS
| Cf. A008596, A008597.
Sequence in context: A046101 A044856 A044901 * A044061 A033028 A044841
Adjacent sequences: A008595 A008596 A008597 * A008599 A008600 A008601
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
