|
Search: id:A038721
|
|
| |
|
| 2, 18, 110, 570, 2702, 12138, 52670, 223290, 931502, 3842058, 15718430, 63928410, 258885902, 1045076778, 4208939390, 16921719930, 67944897902, 272553908298, 1092539107550, 4377127901850, 17529428119502, 70180466208618
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
For n>=1, a(n) is equal to the number of functions f: {1,2,...,n+1}->{1,2,3,4} such that Im(f) contains 2 fixed elements. - Aleksandar M. Janjic and Milan R. Janjic (agnus(AT)blic.net), Feb 27 2007
|
|
REFERENCES
|
R. B. Nelsen and H. Schmidt, Jr., Chains in power sets, Math. Mag., 64 (1991), 23-31.
|
|
LINKS
|
Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets
Index entries for sequences related to posets
|
|
FORMULA
|
4^(n+1) - 2*3^(n+1) + 2^(n+1).
|
|
CROSSREFS
|
Cf. A038720.
Sequence in context: A101570 A006043 A112328 this_sequence A064837 A027433 A007798
Adjacent sequences: A038718 A038719 A038720 this_sequence A038722 A038723 A038724
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, May 02 2000
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), May 09 2000
|
|
|
Search completed in 0.002 seconds
|
