59698

Appears in sequences

• "DFK" (bracelet, size, unlabeled) transform of 2,1,1,1...at n=38A032215
• a(n) = [x^(2^n+n-1)] (x + x^2 + x^4 + x^8 + ... + x^(2^n))^n / n for n>=1.at n=8A135069
• Number of 3Xn arrays containing n copies of 0..3-1 with no element 1 greater than its north or northeast neighbor modulo 3 and the upper left element equal to 0.at n=8A266600
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any north or northeast neighbors modulo n and the upper left element equal to 0.at n=57A267553
• Number of 2Xn 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=9A281564
• Start with 209; if even, divide by 2; if odd, add the next three primes: Trajectory of 209 under iterations of A174221, the "PrimeLatz" map.at n=25A293981