OFFSET
1,2
COMMENTS
k is a term if (k^2+k)/2 + ((k+1)^2+k+1)/2 = k^2+2*k+1 = (k+1)^2 is divisible by sigma(k).
Trivial case: If k is prime, then sigma(k) = k+1 and (k+1)^2 is divisible by k+1, thus all primes are terms of this sequence.
Table with the percentage of primes <= 10^k compared with the number of terms and the number of primes <= 10^k, for k = 2..8:
.
| k | #terms <= 10^k | #primes <= 10^k | %primes <= 10^k |
| 2 | 27 | 25 | 92.59 |
| 3 | 175 | 168 | 96.00 |
| 4 | 1248 | 1229 | 98.48 |
| 5 | 9627 | 9592 | 99.64 |
| 6 | 78565 | 78498 | 99.91 |
| 7 | 664707 | 664579 | 99.98 |
| 8 | 5761724 | 5761455 | 99.99 |
.
The percentage of primes increases asymptotically as 10^k increases.
Conjecture: The asymptotic density of primes in this sequence is 1.
Contains terms like 2, 399, 935, 1539,.. which are not in A210494. Does not contain terms like 775, 819, 3335, 6815,.. which are in A210494. - R. J. Mathar, Jan 18 2024
EXAMPLE
3 is a term since (3+1)^2 = 4^2 = 16 is divisible by sigma(3) = 4.
35 is a term since (35+1)^2 = 36^2 = 1296 is divisible by sigma(35) = 48.
42 is not a term since (42+1)^2 = 43^2 = 1849 is not divisible by sigma(42) = 96.
MAPLE
isA369093 := proc(k)
if modp((k+1)^2, numtheory[sigma](k)) = 0 then
true;
else
false;
end if;
end proc:
A369093 := proc(n)
option remember ;
if n = 1 then
1;
else
for a from procname(n-1)+1 do
if isA369093(a) then
return a;
end if;
end do:
end if;
end proc:
[seq(A369093(n), n=1..100)] ; # R. J. Mathar, Jan 18 2024
PROG
(PARI) isok(n) = my(x=(n+1)^2, y=sigma(n)); !(x%y);
KEYWORD
nonn,easy
AUTHOR
Claude H. R. Dequatre, Jan 13 2024
STATUS
approved