86539

Properties

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=18A049902
• a(n) = 82n^3 - 1228n^2 + 6130n - 5861.at n=15A076808
• Prime numbers in their order of occurrence and generated by A119751, the sequence of odd numbers defined recursively by a(1)=1 and a(i) + a(j) + 1 is prime for all i,j.at n=23A119753
• a(n) is the smallest odd number that makes a(n)*2^N(n)-1 prime, where N(n) is the n-th Mersenne number that makes 2^N(n)-1 prime.at n=27A135434
• Primes of the form abs(82n^3 - 1228n^2 + 6130n - 5861) in order of increasing nonnegative n.at n=15A272324
• Number of 5 dots bracelet partitions of n.at n=12A328543
• Prime numbersat n=8416