cp's OEIS Frontend

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.

A341408 Number of partitions of n into 3 nonprime parts.

This page as a plain text file.
%I A341408 #33 Mar 28 2021 12:11:59
%S A341408 1,0,0,1,0,1,1,1,2,2,2,3,2,4,5,5,5,7,6,9,8,11,10,13,12,16,14,19,16,22,
%T A341408 19,26,22,29,27,33,28,39,33,42,38,47,43,53,45,58,52,63,59,70,61,77,68,
%U A341408 83,76,91,79,98,88,105,95,115,102,121,111,130,119,141,124,148
%N A341408 Number of partitions of n into 3 nonprime parts.
%p A341408 b:= proc(n, i, t) option remember; `if`(n=0,
%p A341408       `if`(t=0, 1, 0), `if`(i<1 or t<1, 0, b(n, i-1, t)+
%p A341408       `if`(isprime(i), 0, b(n-i, min(n-i, i), t-1))))
%p A341408     end:
%p A341408 a:= n-> b(n$2, 3):
%p A341408 seq(a(n), n=3..72);  # _Alois P. Heinz_, Feb 12 2021
%t A341408 b[n_, i_, t_] := b[n, i, t] = If[n == 0,
%t A341408      If[t == 0, 1, 0], If[i < 1 || t < 1, 0, b[n, i - 1, t] +
%t A341408      If[PrimeQ[i], 0, b[n - i, Min[n - i, i], t - 1]]]];
%t A341408 a[n_] := b[n, n, 3];
%t A341408 a /@ Range[3, 72] (* _Jean-François Alcover_, Mar 28 2021, after _Alois P. Heinz_ *)
%Y A341408 Cf. A002095, A005171, A018252, A062610, A068307, A341451, A341452, A341453, A341454, A341455, A341457.
%K A341408 nonn
%O A341408 3,9
%A A341408 _Ilya Gutkovskiy_, Feb 12 2021