27146

Appears in sequences

• dot_product(n,n-1,...2,1)*(7,8,...,n,1,2,3,4,5,6).at n=42A026066
• Number of partitions satisfying cn(0,5) + cn(2,5) + cn(3,5) < cn(1,5) + cn(4,5).at n=41A039881
• Integer part of the area of consecutive prime sided tetragons with one right angle.at n=38A105270
• Even numbers k such that if a person is born in year k and lives not more than 100 years, then he never celebrates his prime birthday on a prime year.at n=33A124658
• Number of squares (of nonnegative integers) that require n binary (base-2) digits.at n=33A126726
• a(n) is the ceiling of 2^n * (sqrt(2)-1), i.e., a(n)-1 is the number whose binary representation gives the first n bits of sqrt(2)-1.at n=15A136322
• Partial sums of A152896.at n=8A152897
• Array read by antidiagonals of higher order Fubini numbers.at n=49A153278
• Number of triangular numbers T(k) between powers of 2, 2^(n-1) < T(k) <= 2^n.at n=32A190660
• Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to or 1 greater than any north, west or southwest neighbors modulo 4 and the upper left element equal to 0.at n=9A267344
• Least number x such that x^n has n digits equal to k. Case k = 3.at n=23A285450
• Expansion of Product_{k>=1} 1/(1 - x^k)^A007437(k).at n=12A301873
• a(n) = floor( Sum_{k=0..n-1} n^k / (k! * a(k)) ), for n > 0 with a(0) = 1.at n=18A357549
• Number of unsensed combinatorial maps with n edges and without faces of degree 1.at n=7A380366