|
|
A221882
|
|
Number of order-preserving or order-reversing full contraction mappings of an n-chain.
|
|
6
|
|
|
1, 4, 13, 36, 91, 218, 505, 1144, 2551, 5622, 12277, 26612, 57331, 122866, 262129, 557040, 1179631, 2490350, 5242861, 11010028, 23068651, 48234474, 100663273, 209715176, 436207591, 905969638, 1879048165, 3892314084, 8053063651, 16642998242, 34359738337
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
a(n) is also the order of the semigroup (monoid) of order-preserving or order-reversing full contraction mappings (of an n-chain).
|
|
REFERENCES
|
A. D. Adeshola, V. Maltcev, and A. Umar, Combinatorial results for certain semigroups of order-preserving full contraction mappings of a finite chain, (submitted 2013).
|
|
LINKS
|
|
|
FORMULA
|
a(n) = (n+1)*2^(n-1) - n.
a(n) = +6*a(n-1) -13*a(n-2) +12*a(n-3) -4*a(n-4).
G.f.: x*(1-2*x+2*x^2-2*x^3)/(1-3*x+2*x^2)^2. [Bruno Berselli, Mar 01 2013]
|
|
EXAMPLE
|
a(3) = 13 because there are exactly 13 order-preserving or order-reversing full contraction mappings of a 3-chain, namely: (111), (112), (211), (122), (221), (123), (321), (222), (223), (233), (322), (332), (333).
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|