26131

Appears in sequences

• Number of ways to get ten-pin bowling score of 300-n.at n=48A079596
• 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, 0), (-1, 1, -1), (0, 1, 0), (1, -1, -1), (1, 1, 1)}.at n=8A150358
• a(n) = n^3 - 4*n^2 + 6*n - 2.at n=28A188377
• Number of (n+1) X (4+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits.at n=4A262328
• Number of (n+1)X(5+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits.at n=3A262329
• T(n,k) = Number of (n+1) X (k+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits.at n=31A262332
• T(n,k) = Number of (n+1) X (k+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits.at n=32A262332
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 675", based on the 5-celled von Neumann neighborhood.at n=26A273408
• Least b > 1 such that (b^(prime(n)^2) - 1)/(b^prime(n) - 1) is prime.at n=49A353101