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.

A345988 Smallest oblong number m*(m+1) that is divisible by n.

Original entry on oeis.org

2, 2, 6, 12, 20, 6, 42, 56, 72, 20, 110, 12, 156, 42, 30, 240, 272, 72, 342, 20, 42, 110, 506, 72, 600, 156, 702, 56, 812, 30, 930, 992, 132, 272, 210, 72, 1332, 342, 156, 240, 1640, 42, 1806, 132, 90, 506, 2162, 240, 2352, 600, 306, 156, 2756, 702, 110, 56, 342, 812, 3422, 240
Offset: 1

Views

Author

N. J. A. Sloane, Jul 13 2021

Keywords

Comments

Equals A344005(n)*(A344005(n)+1). See A344005 for much more about this problem.

Crossrefs

Programs

  • Mathematica
    Module[{nn=60,ob},ob=Table[m(m+1),{m,nn}];Table[SelectFirst[ob,Mod[#,n]==0&],{n,nn}]] (* Harvey P. Dale, Jul 10 2024 *)