32583

Appears in sequences

• Numerators of continued fraction convergents to sqrt(159).at n=10A041292
• Numerators of continued fraction convergents to sqrt(636).at n=6A042220
• Numbers n such that phi(phi(n)) + sigma(sigma(n)) = phi(sigma(n)) + sigma(phi(n)), where phi=A000010 is Euler's totient function and sigma=A000203 is the sum of divisors function.at n=5A066850
• Least k such that k*(2^p-1)*(k*(2^p-1)+1)+1 is prime, where 2^p-1 runs through the Mersenne primes.at n=23A137909
• Number of permutations of [n] avoiding {1324, 2314, 2431}.at n=10A294818