24546

Appears in sequences

• a(n) = floor(sqrt( 2*Pi )^n).at n=11A001674
• a(n) = round(sqrt( 2*Pi )^n).at n=11A001675
• A B3-sequence: a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the sums of any three terms are all distinct.at n=23A096772
• Numbers n such that n^24 + 1 = p*q with p,q distinct primes.at n=36A119982
• Inverse Moebius transform of A100107.at n=20A130878
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, without move-in move-out left turns.at n=22A221551
• Number of 2Xn arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, without move-in move-out left turns.at n=5A221552
• a(n) = 2^n*(n + 1) - 3*(n - 1).at n=10A291064
• Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 6 king-move adjacent elements, with upper left element zero.at n=6A299003
• Number of nX7 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 6 king-move adjacent elements, with upper left element zero.at n=2A299007
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 6 king-move adjacent elements, with upper left element zero.at n=38A299008
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 6 king-move adjacent elements, with upper left element zero.at n=42A299008
• Number of partitions of n into 6 or more parts.at n=32A347542