84500
domain: N
Appears in sequences
- Number of permutations p of (1,2,3,...,n) such that k+p(k) is a Fibonacci number for 1 <= k <= n.at n=62A097082
- Numbers n that are the hypotenuse of exactly 17 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 17 ways.at n=6A097239
- Numbers of the form p^3*q^2*r^2 where p, q, and r are distinct primes.at n=34A179695
- Number of 0..n arrays x(0..4) of 5 elements with each no smaller than the sum of its previous elements modulo (n+1).at n=14A200254
- Numbers such that the list of exponents of their factorization is a palindromic list of primes.at n=15A322525
- Terms of A301517 that are not exponentially odd numbers (A268335).at n=6A335989
- Primitive coreful abundant numbers: coreful abundant numbers having no coreful abundant aliquot divisor.at n=29A339940
- Primitive coreful Zumkeller numbers: coreful Zumkeller numbers (A339979) having no coreful Zumkeller aliquot divisor.at n=12A339981