25988

Appears in sequences

• Expansion of e.g.f. (2 - e^x)^(-2).at n=6A005649
• First differences of the Poly-Bernoulli numbers B_n^(k) with k=-2 (A027649).at n=9A053581
• Triangular array read by rows: a(n, k) = sum of number of ordered factorizations of all prime signatures with n total prime factors and k distinct prime factors.at n=26A095705
• Triangular array read by rows: a(n, k) = number of ordered factorizations of a "hook-type" number with n total prime factors and k distinct prime factors. "Hook-type" means that only one prime can have multiplicity > 1.at n=26A098348
• Erroneous version of A005649.at n=6A100623
• T(n,k) = Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*A000670(n-k+i).at n=34A122101
• A tabular sequence of arrays counting ordered factorizations over least prime signatures. The unordered version is described by sequence A129306.at n=34A131420
• a(n) is the number of ordered partitions of {1,1,2,3,...,n-1}.at n=6A172109
• Array read by antidiagonals: T(n,k) = number of barred preferential arrangements of k things with n bars (k >=0, n >= 0).at n=34A226513
• Column 6 of array in A226513.at n=1A226801
• Number of perfect partitions in graded colexicographic order.at n=43A238962
• Number of perfect partitions in canonical order.at n=43A238975
• Number of (n+2)X(6+2) 0..1 arrays with every 2X2 and 3X3 subblock diagonal maximum minus antidiagonal minimum nondecreasing horizontally and vertically.at n=6A253508
• Number of (n+2)X(7+2) 0..1 arrays with every 2X2 and 3X3 subblock diagonal maximum minus antidiagonal minimum nondecreasing horizontally and vertically.at n=5A253509
• Numbers k for which rank of the elliptic curve y^2=x^3+k*x is 4.at n=23A309031
• Number of achiral loops (necklaces or bracelets) of length n with integer entries that cover an initial interval of positive integers.at n=12A327868
• Number of integer partitions of n whose augmented differences are an aperiodic word.at n=38A329136
• Triangle read by rows where T(n,k) is the number of patterns of length n with k runs.at n=35A335461
• Triangle read by rows where T(n,k) is the number of length-n sequences covering an initial interval of positive integers with k maximal anti-runs.at n=29A337506
• Array read by downward antidiagonals: A(n,k) = Sum_{i=0..n-1} Sum_{j=0..k+1} binomial(n-1,i)*binomial(k+1,j)*A(i,j) with A(0,k) = 1, n >= 0, k >= 0.at n=27A383410