29880

Appears in sequences

• Number of partitions satisfying cn(0,5) + cn(2,5) <= cn(1,5) and cn(0,5) + cn(2,5) <= cn(4,5) and cn(0,5) + cn(3,5) <= cn(1,5) and cn(0,5) + cn(3,5) <= cn(4,5).at n=51A039883
• Triangle read by rows: a(n, n) = n! and for 1 <= k < n, a(n, k) = Sum_{i=0..n-1} Product_{j=i+1..i+k} f(j, n), where for x <= y, f(x, y) = x and for x > y, f(x, y) = x-y.at n=40A109876
• Numbers k such that the digits of sigma(k) are a permutation of those of k, in base 10.at n=30A115920
• Numbers k such that if you subtract k-reversed from k you get a natural number with the same digits as k.at n=8A121969
• Retrograde trajectory of 11 under map n -> A132988(n).at n=46A132991
• Terms of A061047 ending in 0.at n=33A146950
• Numbers k such that k^2 + 1 == 0 (mod 41^2).at n=35A157116
• Total number of L shapes in all tilings of a 5 X n rectangle with pentominoes of any shape.at n=6A247737
• Expansion of b(q^3) * b(q^12) / (b(-q) * b(q^6)) in powers of q where b() is a cubic AGM theta function.at n=14A258111
• Triangle read by rows, T(n,k) are covariances of inverse power traces of complex Wishart matrices with parameter c=2, for n>=1 and 1<=k<=n.at n=11A272865
• Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] in a circle where adjacent values cannot be consecutive modulo n, rotations are distinct.at n=61A338849
• Irregular triangle read by rows where T(n,k) is the number of independent sets of size k in the n-folded cube graph.at n=23A355227
• Expansion of e.g.f. (1/x) * Series_Reversion( x*(1 - log(1+3*x)/3) ).at n=8A370937
• Numbers k such that sigma(k) AND 3*k = 3*k, where AND is bitwise-and, A004198.at n=42A388022