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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A164295 Triangle T(n,k) read by rows: sum of the triangles A054521 and A051731. 1

%I #9 Sep 13 2017 12:22:26

%S 2,2,1,2,1,1,2,1,1,1,2,1,1,1,1,2,1,1,0,1,1,2,1,1,1,1,1,1,2,1,1,1,1,0,

%T 1,1,2,1,1,1,1,0,1,1,1,2,1,1,0,1,0,1,0,1,1,2,1,1,1,1,1,1,1,1,1,1,2,1,

%U 1,1,1,1,1,0,0,0,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,0,1,0,1,0,1,0,1,0,1,1

%N Triangle T(n,k) read by rows: sum of the triangles A054521 and A051731.

%C Zeros in the table, for example T(6,4)=0, indicate that the row and column indices n and k are not coprime and in addition that there is a nonzero remainder n (mod k).

%H G. C. Greubel, <a href="/A164295/b164295.txt">Table of n, a(n) for the first 50 rows, flattened</a>

%F T(n,k) = A054521(n,k) + A051731(n,k), 1<=k<=n, 1<=n.

%e The table starts

%e 2

%e 2, 1

%e 2, 1, 1

%e 2, 1, 1, 1

%e 2, 1, 1, 1, 1

%e 2, 1, 1, 0, 1, 1

%e 2, 1, 1, 1, 1, 1, 1

%e 2, 1, 1, 1, 1, 0, 1, 1

%e 2, 1, 1, 1, 1, 0, 1, 1, 1

%e 2, 1, 1, 0, 1, 0, 1, 0, 1, 1

%p A054521 := proc(n,k) if gcd(n,k) = 1 then 1; else 0 ; fi; end:

%p A051731 := proc(n,k) if (n mod k) = 0 then 1; else 0 ; fi; end:

%p A164295 := proc(n,k) A054521(n,k)+A051731(n,k) ; end: seq(seq(A164295(n,k),k=1..n),n=1..10) ;

%t T[n_, k_] = If[Mod[n, k] == 0, 1, 0] + If[GCD[n, k] == 1, 1, 0];

%t Table[Table[T[n, k], {k, 1, n}], {n, 1, 10}]; Flatten[%]

%Y Cf. A054521, A051731.

%K nonn,tabl

%O 1,1

%A _Roger L. Bagula_ and _Mats Granvik_, Aug 12 2009

%E Edited by the Associate Editors of the OEIS, Aug 28 2009

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 10 19:25 EDT 2024. Contains 375058 sequences. (Running on oeis4.)