60762

Appears in sequences

• Squarefree oblong (pronic) numbers having an odd number of prime factors.at n=34A098827
• Triangle, T(n, k) = coefficients [x^k]( p(x,n) ), where p(x, n) = (x+1)^n for n < 2, otherwise (x+1)^n + x*((1+x)^(n-2) + 2^(n-2)*(1-x)^(n-1)*LerchPhi(x, 2-n, 1/2)), read by rows.at n=48A147566
• Triangle, T(n, k) = coefficients [x^k]( p(x,n) ), where p(x, n) = (x+1)^n for n < 2, otherwise (x+1)^n + x*((1+x)^(n-2) + 2^(n-2)*(1-x)^(n-1)*LerchPhi(x, 2-n, 1/2)), read by rows.at n=51A147566
• Number of ways to place 2 nonattacking bishops on an n X n board.at n=18A172123
• Number of nX5 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=5A207658
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=50A207661
• Number of 6Xn 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=4A207664
• a(n) = n*(n+1)*(n+3).at n=38A317637
• For m to be a term there must exist three Euclidean divisions of m by d, d', and d", m = d*q + r = d'*q' + r' = d"*q" + r", such that (r, q, d), (r', d', q'), and (q", r", d") are three geometric progressions.at n=7A335272
• Oblong numbers which are products of five distinct primes.at n=16A359304
• Products of 5 distinct primes that are sandwiched between twin prime numbers.at n=44A376380