24237

Appears in sequences

• s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).at n=37A024600
• s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).at n=36A025114
• Numbers k such that pi(k) = sopf(k) where sopf(k) is sum of distinct prime factors of k (A008472).at n=22A064444
• Numbers whose square is a zeroless pandigital number (i.e., use the digits 1 through 9 once).at n=16A071519
• Number of benzenoids with 23 hexagons, C_(2v) symmetry and containing n carbon atoms.at n=15A123142
• Number T(n,k) of equivalence classes of ways of placing k 3 X 3 tiles in an n X 8 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=3, 0<=k<=2*floor(n/3), read by rows.at n=51A238558
• Numbers whose square contains all of the digits 1 through 9.at n=16A294661
• a(n) = binomial(2*n-1,n) - n*(n-1) - 1.at n=8A352027
• Position of n-th appearance of 2n in the sequence of prime gaps (A001223). If 2n does not appear at least n times, set a(n) = -1.at n=26A356223
• Numbers k such that 256 * 3^k + 1 is prime.at n=36A390051