This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A350959 #8 Jul 09 2025 04:58:08 %S A350959 0,1,1,2,2,2,2,3,1,3,4,2,2,3,1,2,3,3,2,4,1,2,5,2,3,3,1,3,2,1,3,4,1,2, %T A350959 5,2,2,6,3,2,3,3,2,4,1,3,3,2,1,3,2,2,6,2,2,5,2,3,4,1,2,2,2,0,3,3,3,5, %U A350959 1,4,4,3,3,4,0,2,4,2,2,4,2,1,5,3,3,5,2,3,2,1,4,4,1,2,4,1,1,6,2,4,5 %N A350959 Number of ways to write 2*n+1 as 2^i (i >= 0) plus a prime. %F A350959 a(n) = A109925(2*n+1). - _R. J. Mathar_, Mar 07 2022 %Y A350959 Cf. A006285, A350957, A109925. %K A350959 nonn %O A350959 0,4 %A A350959 _N. J. A. Sloane_, Feb 06 2022, answering a question from _David W. Lewis_