156240

Appears in sequences

• Number of 3 X n binary matrices up to row and column permutations.at n=20A002727
• Theta series of A_9 lattice.at n=8A008449
• E.g.f. (1-2x)/(1-2x-x^2+x^3).at n=7A052613
• A097806^24 * A000594.at n=8A128380
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (-1, 1, 1), (1, -1, -1), (1, 1, 0)}.at n=10A149165
• Triangle T(n, k, m) = (m+1)^n*t(n, m)*t(k, n-m)/(k! * (n-k)!), where T(0, k, m) = 1, t(n, k) = Product_{j=1..n} ( Sum_{i=0..j-1} (m+1)^i ), and t(n, 0) = n!, read by rows.at n=17A157285
• Vampire numbers permutations of whose digits are other vampire numbers.at n=17A167266
• E.g.f. satisfies: A(A(x))^3 = A(x)^3 * A'(x).at n=6A179936
• Smallest k such that the partial sums of the divisors of k (in decreasing order) generate n primes.at n=14A187825
• Numbers with prime factorization pqrs^2t^4.at n=17A190384
• Triangle read by rows (1<=k<=n): T(n,k) = (n-k+1)*k! - (k-1)!at n=62A288778
• Smallest integer such that the sum of its n smallest divisors is a Fibonacci number, or 0 if no such integer exists.at n=39A292467
• Numbers i such that Fibonacci(i) is divisible by i, i+1, i+2, and i+3.at n=30A298685
• Triangle read by rows: T(n, k) = n! * 4^k * hypergeom([-k], [-n], -1/4).at n=37A375612
• Expansion of e.g.f. (1/x) * Series_Reversion( x/(1 - log(1-x^2)/x) ).at n=7A391838