46451

Properties

Appears in sequences

• a(n) = Fibonacci(n+1) + prime(n).at n=22A004398
• Primes that remain prime through 4 iterations of function f(x) = 9x + 10.at n=24A023327
• n is prime and is the concatenation of numbers n_1, n_2, n_3, in that order, with n_1 - n_2 = n_3. (Do not allow leading zeros for nonzero n_i.)at n=39A067861
• Primes p such that x^5 = 2 has a solution mod p, but x^(5^2) = 2 has no solution mod p.at n=33A070182
• a(n) = 82n^3 - 1228n^2 + 6130n - 5861.at n=13A076808
• Primes of the form abs(82n^3 - 1228n^2 + 6130n - 5861) in order of increasing nonnegative n.at n=13A272324
• Numbers that are the sum of seven fourth powers in nine or more ways.at n=32A345575
• Numbers that are the sum of seven fourth powers in exactly nine ways.at n=27A345831
• Prime numbersat n=4801