32550

Appears in sequences

• a(n) = Sum_{k=0..n} (-1)^(n-k) C(n,k)*C(k^2,n).at n=5A003235
• Numbers k such that the sum of the squares of the divisors of k is divisible by k.at n=35A046762
• a(n) is the smallest number m such that m has n distinct prime divisors and if p is a prime divisor of m then p*m - 1 is prime.at n=4A092023
• Consider the family of directed graphs with loops. Sequence gives the triangle read by rows giving coefficients of polynomials arising from enumeration of those graphs on n arcs and loops.at n=20A098267
• Gives the i-th coefficient M(k,i) of the decomposition of the polynomials B(k,X^2) in the basis of all B(i,X), where B(i,X) is the i-th binomial polynomial: B(i,X) = X(X-1)...(X-i+1)/i! for any i > 0 and B(0,X) = 1 by definition.at n=30A100344
• The common value of sigma_2 for square-amicable numbers, sigma_2(m)=sigma_2(n), m<n.at n=13A110929
• Coefficients of the second order mock theta function B(q).at n=39A153140
• a(n) = sum of all divisors of all numbers k such that n^2 <= k < (n+1)^2.at n=20A168012
• Sums of 3 distinct primorials.at n=34A177697
• Number of compositions of n with exactly seven occurrences of the largest part.at n=18A243742
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 173", based on the 5-celled von Neumann neighborhood.at n=36A270467
• Triangle read by rows: T(n, k) = Sum_{j=0..n} C(-j-1, -n-1)*L(j, k), L the unsigned Lah numbers A271703, for n >= 0 and 0 <= k <= n.at n=40A271706
• Square array A(row,col) read by antidiagonals: A(1,col) = A276155(col), and for row > 1, A(row,col) = A276154(A(row-1,col)); Dispersion of primorial base left shift A276154 (array transposed).at n=49A276943
• Square array A(row,col): A(row,1) = A276155(row), and for col > 1, A(row,col) = A276154(A(row,col-1)); Dispersion of primorial base left shift A276154.at n=50A276945
• Unitary practical numbers that are nonsquarefree.at n=23A287173
• Triangle read by rows: T(n,k) is the number of chains of length k in the partially ordered (by subspace inclusion) set of all subspaces of GF(2)^n, n>=0, 0<=k<=n.at n=19A293845
• a(n) = 3*(n+1)*(9*n+4).at n=34A304503
• Expansion of 1 + (1/(1-x) + 1/(1-3*x))*x/2 + (1/(1-x) - 8/(1-2*x) + 9/(1-3*x))*x^5/2.at n=11A316779
• a(n) = A328841(A276086(n)).at n=59A328843
• a(n) = A343046(n, n).at n=36A343047