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 A355193 #24 Oct 12 2022 17:16:06 %S A355193 0,0,0,1,1,3,4,8,10,17,22,35,45,67,86,123,156,216,273,369,463,613,765, %T A355193 997,1236,1587,1958,2485,3049,3830,4677,5823,7077,8740,10576,12971, %U A355193 15629,19046,22862,27701,33125,39928,47579,57078,67788,80963,95852,114023 %N A355193 Number of partitions of n that contain at least one odd prime as a part. %F A355193 a(n) = A000041(n) - A355195(n). %e A355193 For n = 6 the partitions of 6 that contain at least one odd prime as a part are [3, 3], [5, 1], [3, 2, 1], [3, 1, 1, 1]. There are four of these partitions so a(6) = 4. %o A355193 (PARI) a(n) = my(nb=0); forpart(p=n, if (#select(x->((x>2) && isprime(x)), Vec(p)) >=1, nb++);); nb; \\ _Michel Marcus_, Jun 23 2022 %Y A355193 Cf. A000041, A065091, A235945, A353188, A355195. %K A355193 nonn %O A355193 0,6 %A A355193 _Omar E. Pol_, Jun 23 2022 %E A355193 More terms from _Michel Marcus_, Jun 23 2022