94376

Appears in sequences

• Expected number of random moves in Tower of Hanoi problem with n disks starting with a randomly chosen position and ending at a position with all disks on the same peg.at n=8A007798
• Pentagonal numbers (A000326) whose digit reversal is a prime.at n=33A115707
• a(n)=a(n-1)+6a(n-2), n>2.at n=10A140796
• Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 0), (-1, 1), (0, -1), (1, 0), (1, 1)}.at n=9A151467
• Number of nX4 binary arrays with each element equal to either the sum mod 2 of its horizontal and vertical neighbors or the sum mod 2 of its diagonal and antidiagonal neighbors.at n=6A183512
• Number of nX7 binary arrays with each element equal to either the sum mod 2 of its horizontal and vertical neighbors or the sum mod 2 of its diagonal and antidiagonal neighbors.at n=3A183515
• T(n,k)=Number of nXk binary arrays with each element equal to either the sum mod 2 of its horizontal and vertical neighbors or the sum mod 2 of its diagonal and antidiagonal neighbors.at n=48A183517
• T(n,k)=Number of nXk binary arrays with each element equal to either the sum mod 2 of its horizontal and vertical neighbors or the sum mod 2 of its diagonal and antidiagonal neighbors.at n=51A183517
• Number of permutations of 4 copies of 1..n introduced in order 1..n with no element equal to another within a distance of 1.at n=4A190830
• Number of permutations of n copies of 1..4 introduced in order 1..4 with no element equal to another within a distance of 1.at n=3A190918
• Number of nX1 0..3 arrays with values 0..3 introduced in row major order, the number of instances of each value within one of each other, and every element equal to zero or two horizontal or vertical neighbors.at n=15A199194
• Triangle read by rows, k!*2^k*S_2(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0.at n=38A225476
• Number of arrangements of n 1's, n 2's, ..., n n's avoiding equal consecutive terms and introduced in ascending order.at n=4A321666
• Square array A(n,k), n >= 1, k >= 1, read by antidiagonals, where A(n,k) is the number of permutations of n copies of 1..k introduced in order 1..k with no element equal to another within a distance of 1.at n=24A322013