25592

Appears in sequences

• Number of graceful permutations of length n.at n=15A006967
• a(n) = prime(n)*prime(n-1) + 1.at n=37A023523
• Partial sums of A120769.at n=46A120770
• a(n) = 64*n^2 - 8.at n=19A158487
• Number of 4-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=28A187157
• Values x for record minima of the positive distance d between the square of an integer y and the fifth power of a positive integer x such that d = y^2 - x^5 (x <> k^2 and y <> k^5).at n=22A198444
• Sum of prime divisors of n (with repetition) is one less than the sum of prime divisors (with repetition) of n+1.at n=26A228126
• Number of (n+1) X (4+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).at n=6A235294
• Number of (n+1) X (7+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).at n=3A235297
• Smallest even k such that lpf(k-1) = prime(n), while lpf(k-3) > prime(n), where lpf=least prime factor (A020639).at n=35A242489
• Smallest even k such that lpf(k-3) > lpf(k-1) >= prime(n), where lpf=least prime factor (A020639).at n=35A242719
• Least even k such that sfdf(k-3) > sfdf(k-1) >= A050376(n), where sfdf(n) is the smallest Fermi-Dirac factor of n (A223490).at n=42A244343
• Numbers k such that A181894(k)+1 = A181894(k+1).at n=27A333802
• Numbers k such that A001414(k+1) = A001414(k)+1 and A001414(k)^2+3*A001414(k)+1 is prime.at n=13A352581