30406

Appears in sequences

• a(n) is the smallest k >= 2 such that k^(2^n)+1 is prime, or -1 if no such k exists.at n=13A056993
• Numbers k such that k^(2^13) + 1 is prime (a generalized Fermat prime).at n=1A226528
• Signed recurrence over enriched p-trees: a(n) = (-1)^(n - 1) + Sum_{y1 + ... + yk = n, y1 >= ... >= yk > 0, k > 1} a(y1) * ... * a(yk).at n=13A300863
• Sum of the largest parts of all compositions of n into distinct parts.at n=22A336903
• Records in A362451.at n=9A362456