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 A358638 #8 Nov 27 2022 11:04:45 %S A358638 1,1,0,0,1,1,1,1,1,2,3,1,2,2,3,3,4,2,4,3,4,4,6,3,6,5,7,5,7,5,8,6,7,7, %T A358638 10,7,11,7,9,9,11,8,12,9,11,10,13,9,14,11,14,11,14,11,16,13,15,13,17, %U A358638 13,19,14,16,15,19,15,21,15,17,17,21,16,22,17,21,18,22,18,25,18,22 %N A358638 Number of partitions of n into at most 2 distinct nonprime parts. %F A358638 For n > 0, a(n) = A005171(n) + A302479(n). %o A358638 (PARI) A358638(n) = if(n<2,1,!isprime(n)+sum(k=1,(n-1)\2,!(isprime(k)+isprime(n-k)))); \\ _Antti Karttunen_, Nov 25 2022 %Y A358638 Cf. A005171, A018252, A096258, A302479, A347788, A358639, A358640. %K A358638 nonn %O A358638 0,10 %A A358638 _Ilya Gutkovskiy_, Nov 24 2022