108045

Appears in sequences

• Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*9^j.at n=16A038275
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*7^j.at n=19A038297
• a(n) is the number k such that 2^(2k+1)-1 = A000668(n+1).at n=29A146768
• Sequence is obtained from Catalan numbers (A000108) by taking the factorial of each digit and adding them up.at n=38A165163
• Triangular array read by rows: T(n, k) is the number of rooted forests on {1, 2, ..., n} in which one tree has been specially designated that contain exactly k trees; n >= 1, 1 <= k <= n.at n=23A225465
• Number of (n+1)X(n+1) arrays of permutations of 0..(n+1)^2-1 with each element having index change +-(.,.) 0,0 1,-2 or 2,-1.at n=3A264121
• Number of (n+1)X(4+1) arrays of permutations of 0..n*5+4 with each element having index change +-(.,.) 0,0 1,-2 or 2,-1.at n=3A264124
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,-2 or 2,-1.at n=24A264128
• Twisted variant of A276086 indexed by A328626.at n=52A328627
• a(n) is the largest odd positive integer that is abundant and has the same prime signature as A279537(n) or 0 if no such integer exists.at n=31A343330
• a(n) = A276086(A328623(n)).at n=44A346233
• Odd nonsquares k for which A161942(k) >= k, where A161942 is the odd part of sigma.at n=2A348743
• Total number of inversions in all parking functions of length n.at n=5A386011
• Odd nondeficient numbers of the form p^(1+4k) * r^2, where p is prime of the form 1+4m, r > 1, and gcd(p,r) = 1.at n=2A386427