17966

Appears in sequences

• Number of partitions of n-set with distinct block sizes.at n=10A007837
• DIK(b)-DIK[ 2 ](b)-b where b is A035082.at n=16A035083
• The start of a record-breaking run of consecutive integers with a number of prime factors not equal to 2.at n=9A067650
• a(n) is the area of the triangle with sides prime(n), prime(n+2) and prime(n+4), rounded down to the nearest integer.at n=40A096384
• Antidiagonal sums of triangle A121775.at n=21A121776
• Number of partitions of n minus the number of primes <= n.at n=35A183151
• Least happy number with next happy number of distance n.at n=32A193573
• Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 4,1,2,0,3 for x=0,1,2,3,4.at n=5A196962
• Number of nX6 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 4,1,2,0,3 for x=0,1,2,3,4.at n=2A196965
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 4,1,2,0,3 for x=0,1,2,3,4.at n=30A196967
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 4,1,2,0,3 for x=0,1,2,3,4.at n=33A196967
• Number T(n,k) of set partitions of [n] with maximal block length multiplicity equal to k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=56A271423
• Numbers n such that phi(n) = Sum_{j=1..k} d(n^j) for some k, where phi(n) is the Euler totient function of n and d(n) is the number of divisors of n.at n=41A283757
• Number of nX5 0..1 arrays with every element unequal to 1, 2, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=10A305513
• Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=6A317120
• Number of nX7 0..1 arrays with every element unequal to 0, 1, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=2A317124
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=38A317125
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=42A317125
• Sum T(n,k) of multinomials M(n; lambda), where lambda ranges over all partitions of n into distinct parts incorporating k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=55A327869
• Triangle read by rows: T(n,k) is the number of multiset partitions of weight n whose union is a k-set where each part has a different size.at n=65A332253