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.

A070555 Sum of positive integers k, where k <= n and gcd(k,2n+1) = gcd(k+1,2n+1).

Original entry on oeis.org

1, 1, 6, 15, 12, 45, 66, 21, 120, 153, 50, 231, 180, 117, 378, 435, 144, 255, 630, 209, 780, 861, 198, 1035, 840, 375, 1326, 729, 476, 1653, 1770, 465, 1056, 2145, 714, 2415, 2556, 555, 1710, 3003, 1080, 3321, 1890, 1161, 3828, 2475, 1334, 2397, 4560, 1323
Offset: 1

Views

Author

Vladeta Jovovic, Apr 29 2002

Keywords

Comments

Note that whenever gcd(k,2n+1) = gcd(k+1,2n+1), this common value must be 1. - David Wasserman, May 13 2003

Crossrefs

Bisection of A069828.

Programs

  • MATLAB
    function m = A070555(n) m = 0; for k = 1:(2*n + 1) if gcd(k, 2*n + 1) == gcd(k + 1, 2*n + 1) m = m + k; end end

Extensions

More terms from David Wasserman, May 13 2003