28958

Appears in sequences

• a(n) = (sum of first n primes)^2 + sum of (squares of first n primes).at n=10A065762
• a(n) = (p-1)! mod p^2 where p = n-th prime.at n=44A112660
• Arises in enumerating Huffman codes, compact trees, and sums of unit fractions.at n=17A194628
• Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) <= number of distinct parts of p.at n=42A241819
• a(0)=1, a(1)=2, a(n) = 31*a(n-1) - 29*a(n-2).at n=4A256278
• Numbers k such that (91*10^k + 11)/3 is prime.at n=26A271822