

A187761


Number of maps f: [n] > [n] with f(x)<=x and f(f(x)) = f(f(f(x))).


9



1, 1, 2, 6, 23, 106, 568, 3459, 23544, 176850, 1451253, 12904312, 123489888, 1264591561, 13790277294, 159466823794, 1948259002647, 25066729706582, 338670605492700, 4792623436607059, 70873649458154500, 1092969062435462254, 17543703470388927229, 292600906102204630092
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


COMMENTS

This sequence and A187771 and A187824 are winners in the contest held at the 2013 AMS/MAA Joint Mathematics Meetings.  T. D. Noe, Jan 14 2013
Number of monotoniclabeled forests on n vertices with rooted trees of height less than 3. A labeled rooted tree is monotoniclabeled if the label of any parent vertex is (strictly) smaller than the label of any offspring vertex. (See comment by Dennis P. Walsh in A000110; with "greater" instead of "smaller"). To see this, consider the maps [1,2,...n] > [0,1,..n1] with f(x) < x.
As the maps are valid (left) inversion tables for permutations (see example), we obtain a simple bijection between permutations and such forests.
For n>=3 column 3 of A179455; maps such that f^[k](x) = f^[k1](x) correspond to column k of A179455 (for n>=k).
Explanation of the Maple routine by Alois P. Heinz, Jan 15 2013: (Start)
b(n,x,y) is the number of forests consisting of trees we want to count, where n nodes are still to be inserted and x nodes at level 0 (the roots) and y nodes at level 1 are already present, plus perhaps some nodes at level 2 (whose number is not of interest).
If the next node is inserted at level 0 then n1 remaining nodes are to be inserted (and level 0 has one more node: x+1). There is only one possibility to do that.
If the next node is inserted at level 1 then again n1 nodes are to be inserted (and level 1 has one more node: y+1). The inserted node can have x different predecessors (at level 0), accounted by the multiplication by x.
If a node is inserted at level 2 then (again) n1 nodes are to be inserted and level 2 has one more node (which is not counted). The inserted node can have y predecessors, accounted by the multiplication by y.
b(0,x,y) = 1 counts any fixed forest that has received all its nodes.
b(n,0,0) counts all forests that can be constructed by inserting n nodes into the empty forest.
(End)
Also the row sums of the Bell transform of the Bell numbers. Since the Bell numbers are the row sums of the Bell transform of the Stirling_2 numbers they might also be called second order Bell numbers. (Also note that the Stirling_2 numbers are the row sums of the Bell transform of the simplest sequence of positive numbers 1,1,1,... which in turn are the row sums of the Bell transform of the characteristic function of 0. See the link 'Bell Transform' for more about this hierarchy which might be called the Bell hirarchy.)  Peter Luschny, Jan 23 2016


LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..400
Peter Luschny, The Bell transform
Peter Luschny, Permutation Trees
D. P. Walsh, Counting forests with Stirling and Bell numbers


FORMULA

Conjecture (confirmed below) about the e.g.f. A(x): Let B(x) = sum(n>=0, b(n) * x^n/n! ) = exp(exp(x)1)) the e.g.f. of the Bell numbers (A000110). Then A(x)=sum(n>=0, a(n) * x^n/n! ) = exp( sum(n>=0, b(n) * x^(n+1)/(n+1)! ) ), see Pari program.
From Joerg Arndt, Jan 14 2013: (Start)
Conjecture (confirmed below): Let C(0,x) = 1 and for k>=1 C(k, x) = exp( integral(C(k1,x)) ) then C(k,x) is the e.g.f. for monotoniclabeled forests on n vertices with rooted trees of height less than k (column k of A179455(n,k) for k>=1, n>=k).
For k=1 (C(1,x)=exp(x)) and k=2 (C(2,x)=exp(exp(x)1)) this is known to be true, for k=3 this is the conjecture above. (End)
From Joerg Arndt, Jan 15 2013: (Start)
Gareth McCaughan, on the mathfun mailing list (Jan 14 2013), writes
"If F is the e.g.f. for Things Of Size n, then exp(F) is the e.g.f. for Multisets Of Things Whose Sizes Add Up To n. (The factorials turn into multinomial coefficients.)
Which means the conjecture is right. (The integral turns that into "multisets of things whose sizes plus 1 add up to n"; a tree is a forest together with a new node on top.)"
(End)


EXAMPLE

There are a(4)=23 such maps f: [0,1,2,3] > [0,1,2,3], all 4 digit mixed radix numbers [f(0), f(1), f(2), f(3)] where 0<=f(k)<=k (rising factorial basis) except for [ 0 0 1 2 ], as f(3)=2 and f(f(3)) = f(2) = 1 != f(f(f(3))) = f(f(2)) = f(1) = 0.
The exception corresponds to the tree 0  1  2  3 (0 is the root), which can be identified with the map [1,2,3,4] > [0,1,2,3] where f(k)=k1.


MAPLE

b:= proc(n, x, y) option remember; `if`(n=0, 1,
b(n1, x+1, y) +x*b(n1, x, y+1) +y*b(n1, x, y))
end:
a:= n> b(n, 0, 0):
seq(a(n), n=0..25); # Alois P. Heinz, Jan 09 2013
# The function BellMatrix is defined in A264428.
B := BellMatrix(n > combinat:bell(n), 24):
seq(add(i, i=LinearAlgebra:Row(B, n)), n=1..24); # Peter Luschny, Jan 23 2016


MATHEMATICA

b[n_, x_, y_] := b[n, x, y] = If[n == 0, 1, b[n1, x+1, y]+x*b[n1, x, y+1]+y*b[n1, x, y]]; a[n_] := b[n, 0, 0]; Table[a[n], {n, 0, 23}] (* JeanFrançois Alcover, Feb 25 2014, after Alois P. Heinz *)
Table[Sum[BellY[n, k, BellB[Range[n]  1]], {k, 0, n}], {n, 0, 20}] (* Vladimir Reshetnikov, Nov 09 2016 *)


PROG

(PARI) /* using e.g.f. A(x) */
x = 'x + O('x^66);
B = exp( exp(x)  1 ); /* e.g.f. of Bell numbers */
A = serconvol( x * B, log(1x) );
/* A = intformal(B) */ /* alternative to last line */
A = exp( A );
Vec( serlaplace( A ) )


CROSSREFS

Cf. A000110 (Number of maps f: [n] > [n] where f(x)<=x and f(f(x))=f(x) ).
Cf. A179455 (permutation trees of power n and height <= k+1 ).
Cf. A000949 (maps f: [n] > [n] where f(f(x)) = f(f(f(x))) ).
Sequence in context: A193321 A263780 A125273 * A277176 A130908 A200404
Adjacent sequences: A187758 A187759 A187760 * A187762 A187763 A187764


KEYWORD

nonn,nice


AUTHOR

Joerg Arndt, Jan 04 2013


STATUS

approved



