The following pages link to (Q4774085):
Displaying 50 items.
- OEIS (Q19297) (← links)
- Development of metrics and a complexity scale for the topology of assembly supply chains (Q280642) (← links)
- On the classification of self-dual \([20,10,9]\) codes over \(\mathrm{GF}(7)\) (Q324265) (← links)
- A generalization of Catalan numbers (Q400357) (← links)
- Maximum size of a minimum watching system and the graphs achieving the bound (Q496659) (← links)
- Extended rate, more GFUN (Q548596) (← links)
- An exactly solvable self-convolutive recurrence (Q623429) (← links)
- On the vector space of the automatic reals (Q671363) (← links)
- Stories about groups and sequences (Q677164) (← links)
- Elementary sequences, sub-Fibonacci sequences (Q686269) (← links)
- Sorting twice through a stack (Q688711) (← links)
- Almost regular integer hexagons (Q753141) (← links)
- Counting and coding identity trees with fixed diameter and bounded degree (Q789398) (← links)
- Cayley permutations (Q792334) (← links)
- Ramanujan's ``lost'' notebook. IV: Stacks and alternating parity in partitions (Q793872) (← links)
- RNA secondary structures and their prediction (Q799529) (← links)
- Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem (Q803152) (← links)
- Multivariate Fuss-Catalan numbers (Q942097) (← links)
- On the Stirling numbers of the first kind arising from probabilistic and statistical problems (Q1053694) (← links)
- Congruences via Abelian groups (Q1065843) (← links)
- On combinatorial differential equations (Q1090823) (← links)
- Distributed match-making (Q1107317) (← links)
- Rings of geometries. II (Q1113084) (← links)
- Critical dynamics and trees (Q1113510) (← links)
- The number of meets between two subsets of a lattice (Q1132900) (← links)
- Alternating permutations and modified Ghandi-polynomials (Q1135853) (← links)
- Lattice paths in regions with the Catalan property (Q1137581) (← links)
- Sur les extensions linéaires d'une famille particuliere d'ordres partiels (Q1138563) (← links)
- Enumerations of ordered trees (Q1144044) (← links)
- Rhyming schemes: crossings and coverings (Q1147712) (← links)
- The enumeration of graphical partitions (Q1150368) (← links)
- Automorphisms on Catalan trees and bracketings (Q1153095) (← links)
- Product-weighted lead codes revisited (Q1165850) (← links)
- Forests and score vectors (Q1167181) (← links)
- Catalan numbers, their generalization, and their uses (Q1174258) (← links)
- Automatic average-case analysis of algorithms (Q1174718) (← links)
- Level number sequences of trees and the lambda algebra (Q1178028) (← links)
- Directions in matrix theory, Auburn 1990, conference report (Q1183218) (← links)
- The error term in Golomb's sequence (Q1185813) (← links)
- Montreal solitaire (Q1186110) (← links)
- On the cookie game (Q1189664) (← links)
- The ring of \(k\)-regular sequences (Q1193879) (← links)
- Random walks with absorbing points (Q1199465) (← links)
- Counting asymmetric enriched trees (Q1199819) (← links)
- The permuted analogues of three Catalan sets (Q1209641) (← links)
- Enumeration of skew Ferrers diagrams and basic Bessel functions (Q1209643) (← links)
- On the cell-growth problem for arbitrary polygons (Q1215640) (← links)
- Alternating permutations and binary increasing trees (Q1216313) (← links)
- Enumeration of plane trees by branches and endpoints (Q1218439) (← links)
- The number of product-weighted lead codes for ballots and its relation to the Ursell functions of the linear Ising model (Q1230783) (← links)
