cp's OEIS Frontend

A200792 Number of partitions of n such that the number of parts and the greatest part are not coprime.

%I A200792 #13 Feb 06 2017 08:45:49
%S A200792 0,0,1,1,3,3,7,8,12,14,24,29,43,53,72,87,119,145,196,241,314,386,505,
%T A200792 617,786,960,1202,1456,1813,2186,2698,3253,3975,4778,5827,6979,8463,
%U A200792 10127,12217,14566,17509,20810,24895,29513,35128,41496,49220,57949,68445
%N A200792 Number of partitions of n such that the number of parts and the greatest part are not coprime.
%H A200792 Alois P. Heinz, <a href="/A200792/b200792.txt">Table of n, a(n) for n = 1..500</a>
%e A200792 a(5) = 3: [1,1,1,2], [1,1,3], [1,4].
%e A200792 a(6) = 3: [1,1,2,2], [1,2,3], [2,4].
%e A200792 a(7) = 7: [1,1,1,1,1,2], [1,2,2,2], [2,2,3], [1,3,3], [1,1,1,4], [3,4], [1,6].
%p A200792 b:= proc(n, j, t) option remember;
%p A200792       add(b(n-i, i, t+1), i=j..iquo(n, 2))+
%p A200792       `if`(igcd(t, n)>1, 1, 0)
%p A200792     end:
%p A200792 a:= n-> b(n, 1, 1):
%p A200792 seq(a(n), n=1..60);
%t A200792 b[n_, j_, t_] := b[n, j, t] = Sum[b[n-i, i, t+1], {i, j, Quotient[n, 2]}] + If[GCD[t, n] > 1, 1, 0]; a[n_] := b[n, 1, 1]; Table[a[n], {n, 1, 60}] (* _Jean-François Alcover_, Feb 06 2017, translated from Maple *)
%Y A200792 Cf. A199887.
%K A200792 nonn
%O A200792 1,5
%A A200792 _Alois P. Heinz_, Nov 22 2011