OFFSET
4,1
COMMENTS
Row 0 contains 0 and 1. Row 1 contains all primes. Rows 2 and 3 are empty. Hence, we start this table with row 4. The length of row n is A099302(n). The first term in row n is A098699(n). The last term is A099303(n). Row n is the set I(n) in the paper by Ufnarovski and Ahlander. They show that all terms in row n are <= (n/2)^2. The upper bound is attained when n = 2p, where p is a prime.
REFERENCES
See A003415.
LINKS
T. D. Noe, Rows n = 4..1000, flattened
Victor Ufnarovski and Bo Ahlander, How to Differentiate a Number, J. Integer Seqs., Vol. 6, 2003.
EXAMPLE
The triangle begins
4
6
9
10
15
14
21, 25
none
8, 35
22
33, 49
26
12, 39, 55
MATHEMATICA
dn[0] = 0; dn[1] = 0; dn[n_] := Module[{f = Transpose[FactorInteger[n]]}, If[PrimeQ[n], 1, Plus @@ (n*f[[2]]/f[[1]])]]; nn = 100; d = Array[dn, (nn/2)^2]; Table[Flatten[Position[d, n]], {n, 4, nn}]
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
T. D. Noe, Apr 23 2011
STATUS
approved