26192

Appears in sequences

• Number of permutations of length n which avoid the patterns 2143, 2431, 3124.at n=9A116826
• Number of permutations of length n which avoid the patterns 213, 51432.at n=10A116849
• The first 10 digits of the fifth root of n contain the digits 0-9.at n=15A119520
• 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, 0, 0), (-1, 1, 1), (0, 0, 1), (1, -1, 1), (1, 1, -1)}.at n=9A148494
• Triangular T(n,k) = T(n-1, k) + T(n-1, k-1) + 5*T(n-2, k-1), read by rows.at n=39A153518
• Triangular T(n,k) = T(n-1, k) + T(n-1, k-1) + 5*T(n-2, k-1), read by rows.at n=41A153518
• Number of ways to place 3 nonattacking bishops on an n X n board.at n=7A172124
• Numbers n such that 41#*2^n-1 is prime, where # denotes the primorial, A002110.at n=78A176061
• Number of 5-step self-avoiding walks on an n X n square summed over all starting positions.at n=17A188150
• Number of (n+1)X(n+1) 0..2 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 2.at n=2A233636
• Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 2.at n=2A233639
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 2 (2 maximizes T(1,1)).at n=12A233644
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 403", based on the 5-celled von Neumann neighborhood.at n=34A271809