40095

Appears in sequences

• Derangement numbers d(n,3) where d(n,k) = k(n-1)(d(n-1,k) + d(n-2,k)), with d(0,k) = 1 and d(1,k) = 0.at n=6A033030
• Expansion of 1/(1-3*x)^9; 9-fold convolution of A000244 (powers of 3).at n=4A036222
• Odd numbers divisible by exactly 8 primes (counted with multiplicity).at n=10A046321
• Expansion of (-1 + 1/(1-9*x)^9)/(81*x); related to A053108.at n=3A053112
• Numbers k such that sigma(prime(k) - 1) == 0 (mod k).at n=32A067758
• Lesser of two consecutive numbers each divisible by a fifth power.at n=11A068783
• a(n) = C(n+3,3)*n^3/4.at n=9A085284
• a(n) = n^2*(2*n+1).at n=27A099721
• a(n) = 3^4 * binomial(n+3, 4).at n=8A102741
• a(n) is the smallest positive integer that is coprime to n and has n divisors.at n=27A136641
• Monotonic ordering of nonnegative differences 6^i-3^j, for 40>= i>=0, j>=0.at n=28A192152
• Square array read by antidiagonals downwards: super Patalan numbers of order 3.at n=40A248324
• G.f. A(x) satisfies: A(x - 3*x^3) = 1/(1 - 3*x).at n=8A276368
• a(n) = (1/4!)*3^(n+2)*(n+7)*(n+2)*(n+1)*(n).at n=3A288838
• Triangle (sans apex) of coefficients of terms of the form (eM_1)^j*(eM_2)^k re construction of triangle A287768.at n=31A288842
• Fixed points of A300956.at n=6A300958
• G.f. A(x) satisfies: Sum_{n>=0} x^n*A(x)^(n*(n+1)/2) = Sum_{n>=0} x^n*(1+x)^(n^2).at n=9A325289
• Numbers k such that 3*4^k+1 is prime.at n=21A326655
• a(n) is the least term of A326835 whose number of divisors is n.at n=27A348199
• Triangle read by rows: T(n, k) = (Sum_{i=0..n-k} (-1)^i * binomial(n-k, i) * A007559(n-i)) * n! / ((n-k)! * A007559(k)) for 0 <= k <= n.at n=21A372921