This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A279102 #13 Dec 06 2016 22:16:00 %S A279102 9,15,25,35,45,49,50,70,77,91,98,110,121,130,135,143,154,169,170,182, %T A279102 187,190,209,221,225,238,242,247,266,286,289,299,315,322,323,338,350, %U A279102 361,374,391,405,418,437,442,484,493,494,506,527,529,550,551,572,578,589,598,638,646,650,667,675,676,682 %N A279102 Numbers n having three parts in the symmetric representation of sigma(n). %C A279102 Let n = 2^m * q with m >= 0 and q odd, let row(n) = floor(sqrt(8*n+1) - 1)/2), and let 1 = d_1 < ... < d_h <= row(n) < d_(h+1) < ... < d_k = q be the k odd divisors of n. %C A279102 The symmetric representation of sigma(n) consists of 3 parts precisely when there is a unique i, 1 <= i < h, such that 2^(m+1) * d_i < d_(i+1) and d_h <= row(n) < 2^(m+1) * d_h. %C A279102 This property of the odd divisors of n is equivalent to the n-th row of the irregular triangle of A249223 consisting of a block of positive numbers, followed by a block of zeros, followed in turn by a block of positive numbers, i.e., determining the first part and the left half of the center part of the symmetric representation of sigma(n), resulting in 3 parts. %C A279102 Let n be the product of two primes p and q satisfying 2 < p < q < 2*p. Then n satisfies the property above so that the odd numbers in A087718 form a subsequence. %e A279102 a(4) = 35 = 5*7 is in the sequence since 1 < 2 < 5 < row(35) = 7 < 10; %e A279102 a(8) = 70 = 2*5*7 is in the sequence since 1 < 4 < 5 < row(70) = 11 < 20; %e A279102 140 = 4*5*7 is not in the sequence since 1 < 5 < 7 < 8 < row(140) = 16 < 20; %e A279102 a(506) = 5950 = 2*25*7*17 is in the sequence since 1*4 < 5 is the only pair of odd divisors 1 < 5 < 7 < 17 < 25 < 35 < 85 < row(5950) = 108 satisfying the property (see A251820). %t A279102 (* support functions are defined in A237048 and A262045 *) %t A279102 segmentsSigma[n_] := Length[Select[SplitBy[a262045[n], #!=0&], First[#]!=0&]] %t A279102 a279102[m_, n_] := Select[Range[m, n], segmentsSigma[#]==3&] %t A279102 a279102[1, 700] (* sequence data *) %t A279102 (* An equivalent, but slower computation is based on A237271 *) %t A279102 a279102[m_, n_] := Select[Range[m, n], a237271[#]==3&] %t A279102 a279102[1,700] (* sequence data *) %Y A279102 Column 3 of A240062. %Y A279102 Cf. A087718, A174973 (column 1), A237048, A237270, A237271, A237593, A239929 (column 2), A249223, A251820, A262045, A279102. %K A279102 nonn %O A279102 1,1 %A A279102 _Hartmut F. W. Hoft_, Dec 06 2016