19188

Appears in sequences

• Number of rooted trees with n nodes with every leaf at height 5.at n=20A048810
• Number of monotone n-weightings of complete bipartite digraph K(3,3).at n=7A085465
• Omit the initial 1 from A000141 and take the Mobius transform.at n=30A190622
• Number of nX3 0,1 arrays indicating 2X2 subblocks of some larger (n+1)X4 binary array having an odd sum, with rows and columns of the latter in lexicographically nondecreasing order.at n=5A227676
• T(n,k)=Number of nXk 0,1 arrays indicating 2X2 subblocks of some larger (n+1)X(k+1) binary array having an odd sum, with rows and columns of the latter in lexicographically nondecreasing order.at n=30A227679
• T(n,k)=Number of nXk 0,1 arrays indicating 2X2 subblocks of some larger (n+1)X(k+1) binary array having an odd sum, with rows and columns of the latter in lexicographically nondecreasing order.at n=33A227679
• Irregular triangle read by rows: T(n,i) = number of n X n semi-canonical binary matrices with exactly i 1's, where 0 <= i <= n^2.at n=85A268523
• Number of n X 4 0..3 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling three no more than once.at n=1A269285
• T(n,k)=Number of nXk 0..3 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling three no more than once.at n=11A269289
• Number of 2 X n 0..3 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling three no more than once.at n=3A269290
• Numbers n such that n * (x-1)/x produces a rotation of the digits in n for some value of x.at n=21A288626
• Growth series for group with presentation < S, T : S^2 = T^3 = (S*T)^9 = 1 >.at n=29A298811
• Sum of the ninth largest parts of the partitions of n into 10 parts.at n=48A326590
• Number of non-isomorphic balanced multiset partitions of weight n.at n=11A340600
• Triangular array T(n,k) read by rows, satisfies A377441(n, k+2) = Sum_{m=0..k} T(k, m)*n^m.at n=49A377443