113324

Appears in sequences

• a(n) is the smallest number whose English name has the letter "f" in the n-th position, or -1 if no such number exists.at n=44A164794
• Number of (n+1)X(2+1) 0..2 arrays with the maximum plus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=4A237457
• Number of (n+1)X(5+1) 0..2 arrays with the maximum plus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=1A237460
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=16A237463
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=19A237463
• Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 2 5 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 2 5 6 or 7.at n=6A252419
• Number of (n+2)X(7+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 2 5 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 2 5 6 or 7.at n=3A252422
• Number of steps J. H. Conway's Fractran program needs to calculate the n-th prime.at n=13A267572