24328

Appears in sequences

• Number of ordered 5-tuples of integers from [ 1,n ] with no common factors among pairs.at n=36A015663
• a(1) = 5; a(n+1) = a(n)-th nonprime, where nonprimes begin at 1.at n=40A025005
• Number of partitions of n into parts not of the form 11k, 11k+2 or 11k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 4 are greater than 1.at n=48A035945
• A functionally symmetric Polynomial as a triangle of coefficients: p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 3)*Sum[(3^(m-1) + 2*m+(n-1) )*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=37A146959
• A functionally symmetric Polynomial as a triangle of coefficients: p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 3)*Sum[(3^(m-1) + 2*m+(n-1) )*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=43A146959
• Number of subsets of {1, 2, ..., n} containing n and having <=6 pairwise coprime elements.at n=36A186990
• Coefficient of x in the reduction of the n-th Fibonacci polynomial by x^3->x^2+2x+1.at n=13A192773
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 201", based on the 5-celled von Neumann neighborhood.at n=34A270722
• a(n) = Sum_{k=0..floor(n/8)} binomial(n,8*k).at n=17A306859
• a(n) = Sum_{k=0..n} binomial(n,k^3).at n=17A369406
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where A(n,k) = n! * k! * [x^n * y^k] exp(x+y) / (exp(x) + exp(y) - exp(x+y))^3.at n=47A382673
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where A(n,k) = n! * k! * [x^n * y^k] exp(x+y) / (exp(x) + exp(y) - exp(x+y))^3.at n=52A382673
• a(n) = 4 - 15 * 2^n + 12 * 3^n.at n=7A382675
• a(n) = Sum_{k=0..floor(3*n/8)} binomial(k+2,3*n-8*k).at n=43A390036
• a(n) = Sum_{k=0..floor(n/2)} binomial(k+1,4*n-8*k+1).at n=34A390221