login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A323726
Odd numbers k such that sigma(k-1) < sigma(k) < sigma(k+1), sigma(n) = A000203.
3
3, 63, 75, 135, 147, 195, 255, 399, 459, 483, 495, 555, 567, 615, 627, 663, 675, 735, 759, 795, 819, 855, 915, 975, 999, 1035, 1095, 1215, 1239, 1287, 1323, 1455, 1515, 1539, 1647, 1659, 1683, 1815, 1827, 1875, 1935, 2079, 2115, 2175, 2235, 2247, 2295, 2415, 2499
OFFSET
1,1
COMMENTS
It appears that most of the terms are divisible by 3; the smallest exception is 13475.
Up to 10^9, 223182 of 20606497 (about 1%) of the terms are not divisible by 3. - Charles R Greathouse IV, Nov 28 2019
LINKS
EXAMPLE
sigma(62) = 96, sigma(63) = 104, sigma(64) = 127. Hence, 63 is in the sequence.
sigma(74) = 114, sigma(75) = 124, sigma(76) = 140. Hence, 75 is in the sequence.
MAPLE
Sigmas:= map(numtheory:-sigma, [$1..3000]):
select(t -> Sigmas[t-1] < Sigmas[t] and Sigmas[t] < Sigmas[t+1],
[seq(i, i=3..3000, 2)]); # Robert Israel, Nov 23 2019
MATHEMATICA
Select[Range[1, 8000, 2], DivisorSigma[1, # - 1] < DivisorSigma[1, (#)] && DivisorSigma[1, #] < DivisorSigma[1, (# + 1)] &]
PROG
(Magma) f:=func<n| DivisorSigma(1, n) lt DivisorSigma(1, n+1) >; [k:k in [3..2500 by 2]| f(k-1) and f(k)] // Marius A. Burtea, Nov 19 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
K. D. Bajpai, Nov 19 2019
STATUS
approved