187200

Appears in sequences

• Number of double-free subsets of {1, 2, ..., n}.at n=21A050291
• a(n) = n(n-1)(n-3)(n-6)...(n-t), where t is the largest triangular number less than n; number of factors in the product is ceiling((sqrt(1+8*n)-1)/2).at n=15A094261
• Member r=13 of the family of Chebyshev sequences S_r(n) defined in A092184.at n=6A098298
• a(n) = binomial(n+2,3)*4^3.at n=24A141478
• Number of n-cycles on the graph of the regular 600-cell, 3 <= n <= 120.at n=3A167985
• Number of n X 5 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=8A208552
• Positive numbers differing from next 3 greater squares by squares.at n=13A218487
• Triangle S(n,k) by rows: coefficients of 3^((n-1)/2)*(x^(1/3)*d/dx)^n when n is odd, and of 3^(n/2)*(x^(2/3)*d/dx)^n when n is even.at n=37A223169
• Numbers k such that distances from k to three nearest squares are three perfect squares.at n=22A234335
• a(n) = Product_{1 <= j <= k <= n} (k^2 + j^2).at n=3A293290
• Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one component by 1 such that for each point p we have abs(p_{i}-p_{(i mod k)+1}) <= 1 and the first component used is p_1; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=38A318191
• Numbers that can be written in two or more ways as the product of three divisors greater than 1 such that the number in binary is contained in the string concatenation of the divisors in binary.at n=19A356143
• Expansion of e.g.f. (1/x) * Series_Reversion( x*(1 - x*exp(x^2)) ).at n=6A370927