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.

A001219 Triangular numbers of form a(a+1)(a+2).

Original entry on oeis.org

0, 6, 120, 210, 990, 185136, 258474216
Offset: 1

Views

Author

Keywords

References

  • R. K. Guy, Unsolved Problems in Number Theory, D3.

Crossrefs

Programs

  • Maple
    count:= 0:
    for a from 0 to 637 do
      p:= a*(a+1)*(a+2);
      if issqr(1+8*p) then
        count:= count+1;
        A[count]:= p;
      fi
    od:
    seq(A[i],i=1..count); # Robert Israel, Jan 14 2015
  • Mathematica
    Select[Times @@@ Partition[Range[0, 700], 3, 1], OddQ[ Sqrt[ 8 # + 1]] &] (* Harvey P. Dale, Nov 04 2017 *)

Formula

a(n) = A000217(A097571(n)). - Michel Marcus, Jan 14 2015