86526

Appears in sequences

• Stirling numbers of second kind S(n,3).at n=12A000392
• Stirling numbers of second kind S2(12,n).at n=2A011561
• a(n) = 2*binomial(3*n-3, n-1)/(2*n-1) for n >= 2, and a(1) = 1.at n=8A046646
• Triangle of rooted planar maps.at n=44A046651
• If n mod 2 = 0 then m := n/2 and a(n) = (3*m)!*(5*m+1)/((m+1)!*(2*m+1)!); otherwise m := (n-1)/2, a(n) = 6*(3*m+2)!/(m!*(2*m+3)!).at n=15A047750
• Number of primitive (aperiodic) palindromic structures using exactly three different symbols.at n=22A056482
• Number of periodic palindromic structures of length n using exactly three different symbols.at n=22A056509
• Number of primitive (period n) periodic palindromic structures using exactly three different symbols.at n=22A056519
• Triangle read by rows: T(n,k) is the number of nonseparable planar maps with r*n edges and a fixed outer face of r*k edges which are invariant under a rotation of 1/r for any r >= 2 (independent of actual value of r).at n=36A091599
• Sequence arising from enumeration of domino tilings of Aztec Pillow-like regions.at n=10A092438
• Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the leftmost child of the root has degree k.at n=37A101401
• G.f. satisfies: A(x) = x/series_reversion(x/G(x)) where A(x) + A(-x) = 2*G(x^2) and G(x) is the g.f. of A046646.at n=16A116637
• Irregular triangle read by rows, Stirling numbers of the second kind: columns shifted to allow (1, 1, 2, 2, 3, 3, ...) terms per row.at n=51A136011
• O.g.f.: Sum_{n>=0} (n^4)^n * exp(-n^4*x) * x^n / n!.at n=3A217914
• a(n) = Stirling2(n^2+n, n).at n=3A218142
• Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (6,n)-rectangular grid with k '1's and (6n-k) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=47A228165
• Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (6,n)-rectangular grid with k '1's and (6n-k) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=57A228165
• The number of binary pattern classes in the (2,n)-rectangular grid with 7 '1's and (2n-7) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=12A228582
• Number of unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 8.at n=51A244462
• Rectangular array read by rows: T(n,k) is the number of words of length n on alphabet {0,1,2} that have exactly k records, n>=0, 0<=k<=3.at n=51A285852