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!)
A080508 Triangle whose n-th row contains the least set (ordered lexicographically) of n distinct positive integers whose geometric mean is an integer. 5

%I #13 Nov 05 2018 21:01:35

%S 1,1,4,1,2,4,1,2,3,216,1,2,3,4,324,1,2,3,4,5,6075000,1,2,3,4,5,6,

%T 30375000,1,2,3,4,5,6,7,750453558750000,1,2,3,4,5,6,7,8,

%U 19699405917187500,1,2,3,4,5,6,7,8,9,459652804734375000,1,2,3,4,5,6,7,8,9,10,9652708899421875000

%N Triangle whose n-th row contains the least set (ordered lexicographically) of n distinct positive integers whose geometric mean is an integer.

%C The n-th row has the form {1,2,...,n-1,x}, where x is as small as possible.

%H Robert Israel, <a href="/A080508/b080508.txt">Table of n, a(n) for n = 1..1485</a> (rows 1 to 54, flattened)

%e Triangle begins:

%e 1;

%e 1, 4;

%e 1, 2, 4;

%e 1, 2, 3, 216;

%e 1, 2, 3, 4, 324;

%e 1, 2, 3, 4, 5, 6075000;

%e ...

%p f:= proc(n) local F;

%p F:= ifactors((n-1)!)[2];

%p mul(t[1]^(n-(t[2] mod n)),t=F)

%p end proc:

%p f(2):= 4:

%p seq(op([seq(j,j=1..i-1),f(i)]),i=1..20); # _Robert Israel_, Nov 04 2018

%t MapAt[{First@ #, 4 Last@ #} &, Array[Append[Range[# - 1], Apply[Times, Prime@ Range@ PrimePi[# - 1]]^#/(# - 1)!] &, 11], 2] // Flatten (* _Michael De Vlieger_, Nov 05 2018 *)

%Y Cf. A080509, A080510, A080504, A080511.

%K nonn,tabl

%O 1,3

%A _Amarnath Murthy_, Mar 20 2003

%E More terms using A080509 from _Michel Marcus_, Nov 04 2018

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 25 10:34 EDT 2024. Contains 371967 sequences. (Running on oeis4.)