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!)
A279186 Maximal entry in n-th row of A279185. 8

%I #24 Mar 13 2018 04:11:59

%S 1,1,1,1,1,1,2,1,2,1,4,1,2,2,1,1,1,2,6,1,2,4,10,1,4,2,6,2,3,1,4,1,4,1,

%T 2,2,6,6,2,1,4,2,6,4,2,10,11,1,6,4,1,2,12,6,4,2,6,3,28,1,4,4,2,1,2,4,

%U 10,1,10,2,12,2,6,6,4,6,4,2,12,1,18,4,20,2,1,6,3,4

%N Maximal entry in n-th row of A279185.

%C See A256608 for LCM of entries in row n.

%C From _Robert Israel_, Dec 15 2016: (Start)

%C If m and k are coprime then a(m*k) = lcm(a(m), a(k)).

%C If n is in A061345 and r = A053575(n) is in A167791, then a(n) = A000010(r). (End)

%H R. J. Mathar, <a href="/A279186/b279186.txt">Table of n, a(n) for n = 1..1000</a>

%p A279186 := proc(n)

%p local a,k ;

%p a := 1 ;

%p for k from 0 to n-1 do

%p a := max(a,A279185(k,n)) ;

%p end do:

%p a ;

%p end proc : # _R. J. Mathar_, Dec 15 2016

%t T[n_, k_] := Module[{g, y, r}, If[k == 0, Return[1]]; y = n; g = GCD[k, y]; While[g > 1, y = y/g; g = GCD[k, y]]; If[y == 1, Return[1]]; r = MultiplicativeOrder[k, y]; r = r/2^IntegerExponent[r, 2]; If[r == 1, Return[1]]; MultiplicativeOrder[2, r]];

%t a[n_] := Table[T[n, k], {k, 0, n - 1}] // Max;

%t Array[a, 90] (* _Jean-François Alcover_, Nov 27 2017, after _Robert Israel_ *)

%Y Cf. A000010, A053575, A063145, A167791, A279185.

%Y Start is same as A256607 and A256608. However, all three are different.

%K nonn

%O 1,7

%A _N. J. A. Sloane_, Dec 14 2016

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 April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)