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.

A225530 Number of ordered pairs (i,j) with i,j >= 0, i + j = n and gcd(i,j) <= 1.

Original entry on oeis.org

1, 2, 1, 2, 2, 4, 2, 6, 4, 6, 4, 10, 4, 12, 6, 8, 8, 16, 6, 18, 8, 12, 10, 22, 8, 20, 12, 18, 12, 28, 8, 30, 16, 20, 16, 24, 12, 36, 18, 24, 16, 40, 12, 42, 20, 24, 22, 46, 16, 42, 20, 32, 24, 52, 18, 40, 24, 36, 28, 58, 16, 60, 30, 36, 32, 48, 20, 66
Offset: 0

Views

Author

Robert Price, May 09 2013

Keywords

Comments

This sequence is in reply to an extension request made in A100449.
Note that gcd(0,m) = m for any m.
Apparently a(n) = A000010(n), n >= 2. - R. J. Mathar, May 11 2013

Crossrefs

Programs

  • Mathematica
    f[n_]:=Length[Complement[Union[Flatten[Table[If[i+j==n&&GCD[i, j]<=1, {i,j}], {i, 0, n}, {j, 0, n}], 1]], {Null}]]; Table[f[n], {n, 0, 100}]