The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A199887 Number of compositions of n such that the number of parts and the greatest part are not coprime. 3

%I #15 Nov 16 2014 14:59:38

%S 0,0,2,1,9,14,24,43,108,227,440,817,1580,3123,6209,12462,25536,52744,

%T 107911,216702,427673,835023,1627607,3195179,6352470,12792446,

%U 25977145,52859412,107195861,215970512,432053205,859546186,1705026253,3381411667,6718113104

%N Number of compositions of n such that the number of parts and the greatest part are not coprime.

%H Alois P. Heinz, <a href="/A199887/b199887.txt">Table of n, a(n) for n = 1..250</a>

%F a(n) = A000079(n-1) - A199886(n).

%e a(5) = 9: [1,1,1,2], [1,1,2,1], [1,1,3], [1,2,1,1], [1,3,1], [1,4], [2,1,1,1], [3,1,1], [4,1].

%p b:= proc(n, t, g) option remember;

%p `if`(n=0, `if`(igcd(g, t)<>1, 1, 0),

%p add(b(n-i, t+1, max(i, g)), i=1..n))

%p end:

%p a:= n-> b(n, 0, 0):

%p seq(a(n), n=1..40);

%t b[n_, t_, g_] := b[n, t, g] = If[n == 0, If[GCD[g, t] != 1, 1, 0], Sum[b[n-i, t+1, Max[i, g]], {i, 1, n}]]; a[n_] := b[n, 0, 0]; Table[a[n], {n, 1, 40}] (* _Jean-François Alcover_, Nov 05 2014, after _Alois P. Heinz_ *)

%Y Cf. A000079, A199886, A200792.

%K nonn

%O 1,3

%A _Alois P. Heinz_, Nov 11 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 1 04:50 EST 2024. Contains 370430 sequences. (Running on oeis4.)