The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A165430 Table T(n,m) read by rows: the greatest common unitary divisor of n and m, n>=1, 1<=m<=n. 18
 1, 1, 2, 1, 1, 3, 1, 1, 1, 4, 1, 1, 1, 1, 5, 1, 2, 3, 1, 1, 6, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 2, 1, 1, 5, 2, 1, 1, 1, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 3, 4, 1, 3, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 13, 1, 2, 1, 1, 1, 2, 7, 1, 1, 2, 1, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS The maximum number which appears in row n and also in row m of A077610. The sequence of the counts of 1 in row n=1,2,3,... is 1, 1, 2, 3, 4, 3, 6, 7, 8, 6, 10, 8, 12, 9, 9,... LINKS Reinhard Zumkeller, Rows n = 1..120 of triangle, flattened Pentti Haukkanen, On a gcd-sum function, Aequat. Math. 76 (1-2) (2008) 168-178. L. Toth, On the Bi-Unitary Analogues of Euler's Arithmetical Function and the Gcd-Sum Function, JIS 12 (2009) 09.5.2, function (k,n)**. EXAMPLE The table starts 1; 1,2 1,1,3 1,1,1,4 1,1,1,1,5 1,2,3,1,1,6 1,1,1,1,1,1,7 1,1,1,1,1,1,1,8 1,1,1,1,1,1,1,1,9 1,2,1,1,5,2,1,1,1,10 MAPLE A077610 := proc(n) local a; a := {} ; for d in numtheory[divisors](n) do if gcd(d, n/d) = 1 then a := a union {d} ; fi; od: a; end:   A165430 := proc(n, m) local cud ; cud := A077610(n) intersect A077610(m) ; max(op(cud)) ; end: seq(seq(A165430(n, m), m=1..n), n=1..20) ; MATHEMATICA A077610[n_] := Module[{a = {}}, Do[If[GCD[d, n/d] == 1, a = a ~Union~ {d}], {d, Divisors[n]}]; a]; A165430[n_, m_] := Module[{cud = A077610[n] ~Intersection~ A077610[m]}, Max[cud]]; Table[Table[A165430[n, m], {m, 1, n}], {n, 1, 20}] // Flatten (* Jean-François Alcover, Dec 12 2013, translated from Maple *) PROG (Haskell) import Data.List (intersect) a165430 n k = last (a077610_row n `intersect` a077610_row k) a165430_row n = map (a165430 n) [1..n] a165430_tabl = map a165430_row [1..] -- Reinhard Zumkeller, Mar 04 2013 (PARI) udivs(n) = {my(d = divisors(n)); select(x->(gcd(x, n/x)==1), d); } T(n, m) = vecmax(setintersect(udivs(n), udivs(m))); \\ Michel Marcus, Oct 11 2015 CROSSREFS Cf. A034444, A275254 (row sums) Sequence in context: A167407 A051340 A216764 * A334215 A164823 A167269 Adjacent sequences:  A165427 A165428 A165429 * A165431 A165432 A165433 KEYWORD easy,nonn,tabl AUTHOR R. J. Mathar, Sep 18 2009 STATUS approved

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

Last modified July 30 13:39 EDT 2021. Contains 346359 sequences. (Running on oeis4.)