login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Triangle where a(1,1) = 1, a(n,m) = number of terms of row (n-1) which are coprime to m.
5

%I #18 Oct 11 2019 16:38:26

%S 1,1,1,2,2,2,3,0,3,0,4,2,0,2,2,5,0,4,0,4,0,6,1,3,1,2,1,3,7,5,4,5,7,3,

%T 7,5,8,7,7,7,5,6,5,7,7,9,7,8,7,7,7,4,7,8,5,10,7,9,7,9,6,5,7,9,6,10,11,

%U 7,6,7,8,4,8,7,6,6,11,4,12,5,9,5,12,5,9,5,9,5,10,5,12,13,9,7,9,6,6,13,9,7

%N Triangle where a(1,1) = 1, a(n,m) = number of terms of row (n-1) which are coprime to m.

%C GCD(m,0) is considered here to be m, so 0 is coprime to no positive integer but 1.

%H Ivan Neretin, <a href="/A112599/b112599.txt">Rows n = 1..101, flattened</a>

%e Row 6 of the triangle is [5,0,4,0,4,0]. Among these terms there are 6 terms coprime to 1, 1 term coprime to 2, 3 terms coprime to 3, 1 term coprime to 4, 2 terms coprime to 5, 1 term coprime to 6 and 3 terms coprime to 7. So row 7 is [6,1,3,1,2,1,3].

%e 1

%e 1 1

%e 2 2 2

%e 3 0 3 0

%e 4 2 0 2 2

%e 5 0 4 0 4 0

%e 6 1 3 1 2 1 3

%e 7 5 4 5 7 3 7 5

%e 8 7 7 7 5 6 5 7 7

%e 9 7 8 7 7 7 4 7 8 5

%t f[l_] := Block[{p, t}, p = l[[ -1]]; k = Length[p]; t = Table[ Sum[ If[GCD[p[[j]], n] == 1, 1, 0], {j, k}], {n, k + 1}]; Return[Append[l, t]];]; Flatten[Nest[f, {{1}}, 13]] (* _Ray Chandler_, Dec 24 2005 *)

%Y Row sums are in A114718. - _Klaus Brockhaus_, Jun 01 2009

%K nonn,tabl,look

%O 1,4

%A _Leroy Quet_, Dec 21 2005

%E Extended by _Ray Chandler_, Dec 24 2005