32291

Appears in sequences

• a(n) = floor(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=100, a(2)=300.at n=21A104908
• Numbers k such that (13*10^k + 83) / 3 is prime.at n=25A276322
• Numbers k such that 8*10^k + 81 is prime.at n=22A287680
• a(n) = a(n-1) + p(n) if p(n) > a(n-1), otherwise a(n) = a(n-1) - p(n), where p is the partition function A000041 (assuming a(n) = 0 for n < 0).at n=47A331165
• Number of rucksack partitions of n: every consecutive constant subsequence has a different sum.at n=51A353864