Answers are grounded in this paper and cite their sources.
This computational note records six further terms of OEIS A108301, the decimal digit sums of Fₙ = 2^(2^n) + 1, at n = 28, …, 33. All six are composite, extending the interval without prime sums to 12 ≤ n ≤ 33. Computations with GMP and a separate libmpdec implementation agree in digit sums, decimal lengths, histograms and decimal SHA-256 for 0 ≤ n ≤ 33. Divisor certificates and verification materials are supplied; later prime terms remain open. Acknowledgment Pilcraft, a voluntary research organization, assembled this publication with AI assistance, including OpenAI's GPT-6.1 Sol and Anthropic's Claude Opus 5.5 and Claude Haiku 5.5. Roles and attribution details are listed in the supplement. Research content: CC0 1.0 within held rights; OEIS-derived data: CC BY-SA 4.0; Pilcraft artwork and presentation design excluded.
No takes yet. Share an insight, caveat, or question.
A 2026 study studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: