The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A232355 Numbers n such that sigma(triangular(n)) = sigma(n)^2. 2

%I #25 Sep 08 2022 08:46:06

%S 1,11,695,991,2839,3707,9347,10703,12847,27089,42251,56419,74671,

%T 115289,168739,191051,219295,233729,280111,300731,326899,353651,

%U 430859,611799,642991,661715,1035827,1116607,1181579,1234519,1365491,1485035,1777099,1854671,1905875

%N Numbers n such that sigma(triangular(n)) = sigma(n)^2.

%C Subsequence of A116990. - _Michel Marcus_, Jun 13 2015

%H Amiram Eldar, <a href="/A232355/b232355.txt">Table of n, a(n) for n = 1..100</a>

%e 11 is in the sequence because sigma(11*12/2) = sigma(66) = 144 = 12^2 = sigma(11)^2.

%t Select[Range@1000000, DivisorSigma[1, #]^2==DivisorSigma[1, (# (# + 1)/2)] &] (* _Vincenzo Librandi_, Jun 13 2015 *)

%o (PARI) isok(n) = sigma(n)^2 == sigma(n*(n+1)/2); \\ _Michel Marcus_, Nov 23 2013

%o (Magma) [n: n in [1..7*10^5] | SumOfDivisors(n*(n+1) div 2) eq SumOfDivisors(n)^2]; // _Vincenzo Librandi_, Jun 13 2015

%Y Cf. A000203 (sigma(n): sum of divisors of n), A000217 (triangular(n): = n*(n+1)/2).

%Y Cf. A074285 (sigma(triangular(n)), A072861 (sigma(n)^2).

%Y Cf. A116990 (indices of triangular numbers whose sum of divisors is square).

%K nonn

%O 1,2

%A _Alex Ratushnyak_, Nov 22 2013

%E More terms from _Michel Marcus_, Nov 23 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 19 08:13 EDT 2024. Contains 372666 sequences. (Running on oeis4.)