44224

Appears in sequences

• Number of relational systems on n nodes. Also number of directed 3-multigraphs with loops on n nodes.at n=2A001374
• Number of self-complementary digraphs with n nodes.at n=6A003086
• Number of step shifted (decimated) sequences using a maximum of two different symbols.at n=17A056371
• Number of step shifted (decimated) sequences using a maximum of four different symbols.at n=8A056373
• Consider a (hollow) triangle with n cells on each edge, for a total of 3(n-1) cells if n>1, or 1 cell if n=1; a(n) is number of ways of labeling cells with 0's and 1's; triangle may be rotated and turned over.at n=6A061709
• Numbers n such that 6^n+5 is prime.at n=24A145106
• Triangle read by rows: T(n,k) is the number of permutations of [n] having k cycles with at most 2 alternating runs (it is assumed that the smallest element of the cycle is in the first position), 0<=k<=n.at n=45A187247
• Number of permutations of [n] having only cycles with at least 3 alternating runs (it is assumed that the smallest element of the cycle is in the first position).at n=9A187248
• Number of (n+1) X (n+1) 0..2 arrays with the maximum plus the upper median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=2A237771
• Number of (n+1)X(3+1) 0..2 arrays with the maximum plus the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=2A237774
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=12A237779
• Number of integer partitions of n with some part that can be written as a nonnegative linear combination of the other distinct parts.at n=41A365068
• a(n) = number of partitions p of n such that the least multiplicity of the parts of p is a part of p.at n=42A365614