cp's OEIS Frontend

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.

A362809 Numbers k for which the area of the first part of the symmetric representation of sigma(k) equals sigma(k)/3 and its width is 1.

This page as a plain text file.
%I A362809 #44 Mar 21 2024 21:12:00
%S A362809 15,207,1023,2975,5950,19359,147455,294910,1207359,5017599,2170814463
%N A362809 Numbers k for which the area of the first part of the symmetric representation of sigma(k) equals sigma(k)/3 and its width is 1.
%C A362809 The symmetric representation of sigma(k), SRS(k), of every term k in this sequence consists of at least 3 parts, with a(1) = 15 and a(5) = 5950 being the only ones among the first 11 terms for which the SRS consists of exactly 3 parts. A251820 is a subsequence. a(12) > 5*10^9.
%C A362809 Suppose that a(n) = 2^i * q, i >= 0 and q odd. Because the first part of SRS(a(n)) has width 1, the smallest prime factor p of q satisfies p > 2^(i+1) -- see the locations of 1's in the triangle of A237048 and computation of widths in A249223. The area of the first part of SRS(a(n)) is (2^(i+1) - 1) * (q+1)/2 = (a(n) + 2^i) * (2^(i+1) - 1) / 2^(i+1) since the first part has 2^(i+1) - 1 legs (see the formula in A237591). Therefore, when 2^i * q is in the sequence then 2^j * q, for 0 <= j <= i is also. Sigma(a(n)) = A068156(i+1) * (a(n) + 2^i) / 2^(i+1).
%C A362809 Conjecture: The area of the first part of SRS(n) being equal to sigma(n)/3 implies that the first part has width 1.
%C A362809 This is true for all odd a(n) since their first part consists of a single leg of width 1. It also holds for even numbers through 10^7.
%C A362809 Observation: Consider the known 11 terms. Apart from 5950 and 294910 the rest are also in A063906. Question: Is A063906 a subsequence? - _Omar E. Pol_, Jul 09 2023
%C A362809 Answer: A063906 consists of the odd terms of this sequence since the first part of the symmetric representation of sigma for odd a(n) equals (a(n)+1)/2 which is equivalent to a(n) = 2*sigma(a(n))/3 - 1, i.e., a(n) is in A063906. - _Hartmut F. W. Hoft_, Jul 10 2023
%C A362809 A063906(10) = 58946212863 is a term here. - _Omar E. Pol_, Jul 12 2023
%e A362809 15 belongs to the sequence since SRS(15) consists of the parts {8, 8, 8} of maximum widths {1, 2, 1} and sigma(15) = 24.
%e A362809 294910 belongs to the sequence since SRS(294910) consists of the 5 parts {221184, 109440, 2304, 109440, 221184} of maximum widths {1, 3, 2, 3, 1}, with 109440 + 2304 + 109440 = 211184 and sigma(294910) = 3 * 211184 = 663552.
%e A362809 From _Omar E. Pol_, Jul 07 2023: (Start)
%e A362809 Illustration of a(1) = 15.
%e A362809 The 14th row of triangle A237593 is [8, 3, 1, 2, 2, 1, 3, 8] and the 15th row of the same triangle is [8, 3, 2, 1, 1, 1, 1, 2, 3, 8] so the diagram of the symmetric representation of sigma(15) in the fourth quadrant is constructed as shown below:
%e A362809 .                                _
%e A362809 .                               | |
%e A362809 .                               | |
%e A362809 .                               | |
%e A362809 .                               | |
%e A362809 .                               | |
%e A362809 .                               | |
%e A362809 .                               | |
%e A362809 .                          _ _ _|_|
%e A362809 .                      _ _| |      8
%e A362809 .                     |    _|
%e A362809 .                    _|  _|
%e A362809 .                   |_ _|  8
%e A362809 .                   |
%e A362809 .    _ _ _ _ _ _ _ _|
%e A362809 .   |_ _ _ _ _ _ _ _|
%e A362809 .                    8
%e A362809 .
%e A362809 The area of the first part (or polygon) of the diagram equals sigma(15)/3 = 24/3 = 8 and its width is 1 so 15 is in the sequence. (End)
%t A362809 (* substitute code suggested by _Andrey Zabolotskiy_ *)
%t A362809 cd[n_, k_] := Boole[Divisible[n, k]]
%t A362809 a237048[s_, j_] := If[OddQ[j], cd[s, j], cd[s-j/2, j]]
%t A362809 firstZeroQ[s_, a_] := Sum[(-1)^(j+1)a237048[s, j], {j, a}]==0
%t A362809 evenPart[n_] := 2^IntegerExponent[n, 2]
%t A362809 a362809[{m_, n_}] := Module[{a, b}, Select[Range[m, n], (a=evenPart[#]; b=(2a-1)/(2a); DivisorSigma[1, #]==3b(#+a)&&firstZeroQ[#, 2a])&]]
%t A362809 a362809[{1, 2170814463}] (* a(11) has a long computation time *)
%Y A362809 Cf. A068156, A235791, A237048, A237591, A237593, A249223, A251820.
%Y A362809 Cf. A063906.
%K A362809 nonn,hard,more
%O A362809 1,1
%A A362809 _Hartmut F. W. Hoft_, May 04 2023