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 A355195 #27 Jun 24 2022 17:12:38 %S A355195 1,1,2,2,4,4,7,7,12,13,20,21,32,34,49,53,75,81,112,121,164,179,237, %T A355195 258,339,371,478,525,669,735,927,1019,1272,1403,1734,1912,2348,2591, %U A355195 3153,3484,4213,4655,5595,6183,7387,8171,9706,10731,12692,14035,16515,18266 %N A355195 Number of partitions of n that do not contain odd primes as parts. %H A355195 <a href="/index/Par#part">Index entries for sequences related to partitions</a> %F A355195 a(n) = A000041(n) - A355193(n). %e A355195 For n = 6 the partitions of 6 that do not contain odd primes as parts are [6], [4, 2], [2, 2, 2], [4, 1, 1], [2, 2, 1, 1], [2, 1, 1, 1, 1] and [1, 1, 1, 1, 1, 1]. There are seven of these partitions so a(6) = 7. %o A355195 (PARI) a(n) = my(nb=0); forpart(p=n, if (#select(x->((x>2) && isprime(x)), Vec(p)) == 0, nb++); ); nb; \\ _Michel Marcus_, Jun 24 2022 %Y A355195 Cf. A000041, A065091, A353188, A355193. %K A355195 nonn %O A355195 0,3 %A A355195 _Omar E. Pol_, Jun 23 2022