52660

Appears in sequences

• Numbers which are the sum of their proper divisors containing the digit 3.at n=6A059462
• Fibonacci + Goldbach: a(1)=6, a(2)=8 and for n>=3, a(n)=g(a(n-1)) + g(a(n-2)), where for m>=3, g(2*m) is the maximal prime p < 2*m such that 2*m - p is prime.at n=24A216275
• a(1) = 0, and for n > 1, a(n) = 2*a(A252463(n)) + [n == 1 (mod 2)]*[J(3|n) == -1], where J is the Jacobi-symbol.at n=60A292255
• Numbers that are the sum of nine fifth powers in three or more ways.at n=2A345620
• Numbers that are the sum of nine fifth powers in exactly three ways.at n=2A346338