18956

Appears in sequences

• Numbers that are the sum of 6 positive 7th powers.at n=37A003373
• a(0) = 1, a(n) = 26*n^2 + 2 for n>0.at n=27A010016
• Number of ordered 5-tuples of integers from [ 1,n ] with no common factors among quadruples.at n=17A015653
• Number of connected unlabeled regular graphs with n nodes such that complement is also connected.at n=11A054916
• Number of partitions of n such that the number of different parts is odd.at n=39A090794
• Numbers n such that n^24 + 1 = p*q with p,q distinct primes.at n=31A119982
• Number of partitions of n^3 into n nonzero squares.at n=9A133103
• Triangle read by rows: number of set partitions of n elements with k connectors, 0<=k<n.at n=47A185982
• a(n,k) is the count of permutations with cycle length k in the products w*w over all permutations w of length n.at n=31A191718
• Number of 3Xn arrays containing n copies of 0..3-1 with no element 1 greater than its north, southwest or southeast neighbor modulo 3 and the upper left element equal to 0.at n=10A266922
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 121", based on the 5-celled von Neumann neighborhood.at n=29A270208
• Number of set partitions of [n] having exactly two pairs (m,m+1) such that m is in some block b and m+1 is in block b+1.at n=8A271789
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 413", based on the 5-celled von Neumann neighborhood.at n=30A272009
• Sum of the second largest parts in the partitions of n into 8 parts.at n=38A308997
• Number of n X n 0..1 arrays with every element unequal to 1, 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=3A316947
• Number of nX4 0..1 arrays with every element unequal to 1, 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=3A316949
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=24A316953
• a(n) = Sum_{k=0..floor(n/3)} binomial(k+3,3) * binomial(k,n-3*k)^2.at n=20A377150
• Triangle read by rows: T(n,k) is the number of n-node Stanley graphs containing exactly k isolated points, n>=0, 0<=k<=n.at n=38A383655