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.

A256151 Triangular numbers n such that sigma(n) is a square number.

This page as a plain text file.
%I A256151 #25 Sep 08 2022 08:46:11
%S A256151 1,3,66,210,820,2346,4278,22578,27966,32131,35511,51681,53956,102378,
%T A256151 169653,173755,177906,223446,241860,256686,306153,310866,349866,
%U A256151 431056,434778,470935,491536,512578,567645,579426,688551,799480,845650,893116,963966,1031766,1110795,1200475,1613706,1719585
%N A256151 Triangular numbers n such that sigma(n) is a square number.
%C A256151 This sequence is the intersection of A000217 and A006532.
%C A256151 The corresponding triangular indices are in A116990. - _Michel Marcus_, Mar 17 2015
%H A256151 Amiram Eldar, <a href="/A256151/b256151.txt">Table of n, a(n) for n = 1..10000</a>
%e A256151 3 is in the sequence because 3=2*3/2 is triangular, and sigma(3)=1+3=4=2^2 is square.
%t A256151 Select[Accumulate[Range[0, 2000]], IntegerQ@Sqrt@DivisorSigma[1, #] &] (* _Michael De Vlieger_, Mar 17 2015 *)
%o A256151 (PARI) {for(i=1,2*10^3,n=i*(i+1)/2;if(issquare(sigma(n)),print1(n,", ")))}
%o A256151 (Magma) [n*(n+1) div 2: n in [1..2000] | IsSquare(SumOfDivisors(n*(n+1) div 2))]; // _Vincenzo Librandi_, Mar 17 2015
%Y A256151 Cf. A000290, A000217, A006532, A074285, A116990, A256149, A256150, A256152.
%K A256151 nonn
%O A256151 1,2
%A A256151 _Antonio Roldán_, Mar 16 2015