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 A062306 #20 Jul 03 2025 18:30:34 %S A062306 1,0,1,4,7,19,36,82,170,362,740,1537,3144,6443,13116,26661,54034, %T A062306 109386,221121,446502,900436,1814910,3655069,7356483,14796994, %U A062306 29750473,59789057,120112121,241218391,484287995,972034297,1950544851,3913243144,7849331541,15741697002 %N A062306 Number of ways writing 2^n as a sum of two nonprime numbers. %H A062306 Amiram Eldar, <a href="/A062306/b062306.txt">Table of n, a(n) for n = 1..40</a> %F A062306 a(n) = A062610(2^n) = number of nonprime+nonprime partitions of 2^n. %F A062306 a(n) = 2^(n-1) - A006307(n) - A062305(n). - _Amiram Eldar_, Jul 17 2024 %e A062306 For n = 5: 2^5 = 32 = 4+28 = 6+26 = 8+24 = 10+22 = 12+20 = 14+18 = 16+16, so a(5) = 7. %Y A062306 Cf. A061358, A062602, A062305, A006307, A062610. %K A062306 nonn %O A062306 1,4 %A A062306 _Labos Elemer_, Jul 05 2001 %E A062306 More terms from _Dean Hickerson_, Jul 23 2001 %E A062306 a(28)-a(32) from _Sean A. Irvine_, Mar 25 2023 %E A062306 a(33)-a(35) from _Amiram Eldar_, Jul 17 2024