27368

Appears in sequences

• Number of partitions satisfying cn(2,5) < cn(0,5) + cn(1,5) + cn(4,5) and cn(3,5) < cn(0,5) + cn(1,5) + cn(4,5).at n=39A039873
• Iccanobirt prime indices (10 of 15): Indices of prime numbers in A102120.at n=17A102140
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (0, 0, 1), (0, 1, 0), (1, 0, -1)}.at n=9A149881
• Number of ways to place n nonattacking composite pieces queen + rider[1,3] on an n X n chessboard.at n=18A189873
• Number of length n+4+2 0..4 arrays with every value 0..4 appearing at least once in every consecutive 4+3 elements, and new values 0..4 introduced in order.at n=5A242319
• T(n,k)=Number of length n+k+2 0..k arrays with every value 0..k appearing at least once in every consecutive k+3 elements, and new values 0..k introduced in order.at n=41A242322
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 593", based on the 5-celled von Neumann neighborhood.at n=15A283182
• Numbers k such that (2*10^k - 23)/3 is prime.at n=19A293000
• Numbers k such that Bernoulli number B_{k} has denominator 61410.at n=12A295591
• a(n) = 4*p(n), where p(n) is the number of partitions of n.at n=31A299474
• a(n) = 1 + Sum_{k=0..n-3} binomial(n-2,k) * a(k).at n=12A344490