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.

A226363 Oblong numbers (A002378) whose sum of divisors is also an oblong number.

Original entry on oeis.org

6, 20, 30, 306, 1722, 2862, 11772, 13572, 28730, 29756, 40602, 54056, 219492, 351056, 463080, 947702, 1391220, 1546292, 2043470, 7174362, 7703400, 11400752, 15104882, 19127502, 20155610, 113667582, 172173762, 314299712, 475654290, 555238532, 558447792, 562519806
Offset: 1

Views

Author

Alex Ratushnyak, Jun 05 2013

Keywords

Crossrefs

Programs

  • Mathematica
    oblongQ[n_] := IntegerQ[(-1 + Sqrt[1 + 4*n])/2]; s = Select[Range[24000], oblongQ[DivisorSigma[1, # (# + 1)]] &]; s * (s + 1) (* T. D. Noe, Jun 12 2013 *)