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.

A205382 s(k)-s(j), where (s(k),s(j)) is the least such pair for which n divides their difference, and s(j)=(2j-1)^2.

Original entry on oeis.org

8, 8, 24, 8, 40, 24, 56, 8, 72, 40, 88, 24, 104, 56, 120, 16, 136, 72, 152, 40, 168, 88, 184, 24, 200, 104, 216, 56, 232, 120, 248, 32, 264, 136, 280, 72, 296, 152, 312, 40, 328, 168, 344, 88, 360, 184, 376, 48, 392, 200, 408, 104, 424, 216, 440, 56, 456
Offset: 1

Views

Author

Clark Kimberling, Jan 26 2012

Keywords

Comments

Duplicate of A109049? For a guide to related sequences, see A204892.

Crossrefs

Programs

  • Mathematica
    (See the program at A205378.)

Formula

a(n) = n*A205383(n). - Luce ETIENNE, Feb 19 2020