A120698 Restricted growth functions for set partitions.

1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 2, 2, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 3, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 2, 1, 1, 2, 2, 2, 1, 2, 2, 3, 1, 2, 3, 1, 1, 2, 3, 2, 1, 2, 3, 3, 1, 2, 3, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 3

Offset: 1

Author

Franklin T. Adams-Watters, Jun 28 2006

Keywords

• nonn
• tabf

Comments

There are restricted growth functions (RGF, sometime called restricted growth strings, RGS) for various kinds of combinatorial objects. For the RGF used here see figure 17.1-D on p.358 of the Fxtbook, see links.

Examples

			Table starts:
  1
  1,1
  1,2
  1,1,1
  1,1,2
  1,2,1
  1,2,2
  1,2,3
		

Links

• Alois P. Heinz, Rows n = 1..5295, flattened
• Joerg Arndt, Matters Computational (The Fxtbook)

Crossrefs

Cf. A000110, A085693 (row maxima), A120699 (row lengths), A193023.

Programs

Mathematica

Flatten[Table[RGFs[n],{n,1,5}]](* Geoffrey Critzer, Dec 08 2010 *)