35035

Appears in sequences

• a(n) = dot_product(1,2,...,n)*(6,7,...,n,1,2,3,4,5).at n=43A026046
• Number of nonempty subsets of {1,2,...,n} in which exactly 1/6 of the elements are <= n/3.at n=20A048001
• Number of nonempty subsets of {1,2,...,n} in which exactly 1/6 of the elements are <= (n+1)/3.at n=20A048047
• Number of nonempty subsets of {1,2,...,n} in which exactly 1/6 of the elements are <= (n+2)/3.at n=20A048080
• Expansion of (1+9*x)/(1-x)^11.at n=6A056114
• Denominators of Pi * average length of a line segment picked at random in the unit n-ball for even n.at n=2A093533
• Indices of primes in sequence defined by A(0) = 63, A(n) = 10*A(n-1) + 13 for n > 0.at n=22A101528
• a(n) = (n+1)*(n+2)^3*(n+3)^4*(n+4)^3*(n+5)*(2n+5)*(2n+7)/7257600.at n=3A109124
• Number triangle T(n,k) = binomial(n,k)*binomial(2n,n-k).at n=31A110608
• a(0) = 1; for n > 0, a(n) = (-1)^(n+1)*B(2n)*Product_{prime p<=2n+1} p where B(2n) denotes the (2n)-th Bernoulli number.at n=7A123536
• a(n) = (n-1)^2*binomial(2n,n)/(2*(n+1)).at n=7A145885
• a(n) = 1001*n.at n=34A153814
• Denominator of Laguerre(n, 6).at n=14A160632
• Triangle T(n, k) = [x^k]( p(n,x) ), where p(n, x) = Sum_{k=1..n} A001263(n,k)*binomial(x+k -1, n-1), read by rows.at n=32A168391
• Number of zero-sum -3..3 arrays of n elements with first through fourth differences also in -3..3.at n=12A201434
• Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of max{1+j mod i, 1+i mod j} (A204018).at n=35A204019
• Numbers n such that the sum of the distinct prime divisors of n that are congruent to 1 mod 4 equals the sum of the distinct prime divisors congruent to 3 mod 4.at n=18A215949
• Triangle read by rows, T(n,k) n>=0, k>=0, generalization of A000255.at n=31A216154
• Triangle T read by rows: T(n,k) = binomial(2*n+1,k)*binomial(n,k), n>=0, 0<=k<=n.at n=34A252501
• Even bisection of A260443 (the odd terms): a(n) = A260443(2*n).at n=34A277323