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.

Showing 1-2 of 2 results.

A209310 Triangular numbers whose sum of triangular divisors is also triangular and greater than 1.

Original entry on oeis.org

6, 4186, 32131, 52975, 78210, 111628, 237016, 247456, 584821, 750925, 1464616, 3649051, 5791906, 11297881, 16082956, 24650731, 27243271, 38618866, 46585378, 51546781, 56026405, 76923406, 89880528, 96070591, 126906346, 164629585, 201854278, 228733966
Offset: 1

Views

Author

Antonio Roldán, Jan 18 2013

Keywords

Examples

			4186 is in sequence because it is triangular (4186 = 91*92/2) and the sum of its triangular divisors, 4186+91+1 = 4278 is also triangular (4278 = 92*93/2).
		

Crossrefs

Subsequence of A209309.

Programs

  • Mathematica
    triQ[n_] := n > 1 && IntegerQ[Sqrt[8*n+1]]; q[n_] := triQ[1 + DivisorSum[n, #&, triQ[#] &]]; Select[Accumulate[Range[22000]], q] (* Amiram Eldar, Aug 12 2023 *)
  • PARI
    istriangular(n)=issquare(8*n+1)
    {t=0; for(n=1, 10^8, if(istriangular(n), k=sumdiv(n, d, istriangular(d)*d) ;if(istriangular(k)&&k>>1,t+=1;write("b209310.txt",t," ",n))))}

A209311 Numbers whose sum of triangular divisors is also a divisor and greater than 1.

Original entry on oeis.org

285, 1302, 1425, 1820, 2508, 3640, 3720, 4845, 4956, 5016, 5415, 7125, 7280, 9100, 9114, 9912, 11685, 12255, 12740, 14508, 15105, 16815, 17385, 18200, 19095, 19824, 20235, 20805, 22134, 22515, 23655, 23660, 24021, 24738, 25365, 25480, 27075, 27588, 27645
Offset: 1

Views

Author

Antonio Roldán, Jan 18 2013

Keywords

Examples

			285 is in the sequence because its divisors being 1, 3, 5, 15, 19, 57, 95, 285, of which 1, 3 and 15 are triangular, these add up to 19.
1302 is in sequence because the sum of triangular divisors 21 + 6 + 3 + 1 = 31 is divisor of 1302.
		

Crossrefs

Programs

  • Mathematica
    TriangularQ[n_] := IntegerQ[Sqrt[1 + 8*n]]; fQ[n_] := Module[{tri = Total[Select[Divisors[n], TriangularQ]]}, tri > 1 && Mod[n, tri] == 0]; Select[Range[28000], fQ] (* T. D. Noe, Jan 23 2013 *)
  • PARI
    istriangular(n)=issquare(8*n+1)
    {t=0; for(n=1, 10^7, k=sumdiv(n, d, istriangular(d)*d); if(n/k==n\k&&k>>1, t+=1; write("b209311.txt",t," ",n)))}
Showing 1-2 of 2 results.