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.

A341457 Number of partitions of n into 9 nonprime parts.

This page as a plain text file.
%I A341457 #12 Feb 23 2022 06:48:25
%S A341457 1,0,0,1,0,1,1,1,2,2,2,3,3,4,6,6,7,9,10,12,15,17,20,24,28,32,38,44,51,
%T A341457 60,67,79,91,104,120,138,154,180,203,232,262,300,335,385,428,489,543,
%U A341457 620,688,782,861,979,1078,1222,1341,1518,1661,1875,2048,2308
%N A341457 Number of partitions of n into 9 nonprime parts.
%H A341457 Alois P. Heinz, <a href="/A341457/b341457.txt">Table of n, a(n) for n = 9..10000</a>
%p A341457 b:= proc(n, i, t) option remember; `if`(n=0,
%p A341457       `if`(t=0, 1, 0), `if`(i<1 or t<1, 0, b(n, i-1, t)+
%p A341457       `if`(isprime(i), 0, b(n-i, min(n-i, i), t-1))))
%p A341457     end:
%p A341457 a:= n-> b(n$2, 9):
%p A341457 seq(a(n), n=9..68);  # _Alois P. Heinz_, Feb 12 2021
%t A341457 b[n_, i_, t_] := b[n, i, t] = If[n == 0,
%t A341457      If[t == 0, 1, 0], If[i < 1 || t < 1, 0, b[n, i - 1, t] +
%t A341457      If[PrimeQ[i], 0, b[n - i, Min[n - i, i], t - 1], 0]]];
%t A341457 a[n_] := b[n, n, 9];
%t A341457 Table[a[n], {n, 9, 68}] (* _Jean-François Alcover_, Feb 23 2022, after _Alois P. Heinz_ *)
%Y A341457 Cf. A002095, A005171, A018252, A062610, A259200, A341408, A341451, A341452, A341453, A341454, A341455.
%K A341457 nonn
%O A341457 9,9
%A A341457 _Ilya Gutkovskiy_, Feb 12 2021