OFFSET
1,2
COMMENTS
The length of row n is A145604(n). The largest x in row n is A145606(n). This is sequence A138180 with only the first occurrence of each number retained. Row n begins with prime(n)-1.
A permutation of the positive integers (when seen as linear sequence). A252489(n) yields the row in which n appears in the table. - M. F. Hasler, Jan 16 2015
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..3106 (rows n = 1..18, flattened), first 1502 terms (rows n = 1..15) by T. D. Noe.
Michael De Vlieger, Log log scatterplot of a(n), n = 1..3106, with a color function showing 1 in black, primes in red, proper prime powers in gold, squarefree composites in green, powerful numbers that are not prime powers in purple, and numbers that are neither powerful nor squarefree in blue.
EXAMPLE
Triangle begins:
1
2, 3, 8
4, 5, 9, 15, 24, 80
6, 7, 14, 20, 27, 35, 48, 49, 63, 125, 224, 2400, 4374
MATHEMATICA
(* Computation using x maxima taken from A145606 *) A145606 = {1, 8, 80, 4374, 9800, 123200, 336140, 11859210, 5142500, 177182720, 1611308699, 3463199999, 63927525375, 421138799639, 1109496723125}; smoothNumbers[p_?PrimeQ, max_] := Module[{a, aa, k, pp, iter}, k = PrimePi[p]; aa = Array[a, k]; pp = Prime[Range[k]]; iter = Table[{a[j], 0, PowerExpand @ Log[pp[[j]], max/Times @@ (Take[pp, j - 1]^Take[aa, j - 1])]}, {j, 1, k}]; Table[Times @@ (pp^aa), Sequence @@ iter // Evaluate] // Flatten // Sort]; smoothMax[n_] := A145606[[n]]; row[n_] := Module[{sn, sn1}, sn = smoothNumbers[Prime[n], smoothMax[n] + 1] ; sn1 = smoothNumbers[Prime[n - 1], smoothMax[n] + 1] ; Select[sn, MemberQ[sn, # + 1] && Not[MemberQ[sn1, #] && MemberQ[sn1, # + 1]] &]]; row[1] = {1}; Table[ro = row[n]; Print[n, " ", ro // Short]; ro, {n, 1, 10}] // Flatten (* Jean-François Alcover, Nov 17 2016 *)
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
T. D. Noe, Oct 14 2008, Nov 03 2008
STATUS
approved
