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.

A340276 Number of partitions of n into 3 parts whose largest two parts are relatively prime.

Original entry on oeis.org

0, 0, 1, 1, 1, 2, 2, 3, 4, 5, 5, 7, 8, 10, 11, 12, 13, 16, 17, 20, 22, 24, 25, 29, 30, 33, 35, 38, 40, 45, 47, 52, 55, 58, 60, 64, 66, 72, 75, 79, 81, 88, 90, 97, 101, 105, 108, 116, 119, 126, 130, 135, 139, 148, 151, 157, 161, 167, 171, 181, 183, 193, 198, 204, 209, 217
Offset: 1

Views

Author

Wesley Ivan Hurt, Jan 02 2021

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Sum[Sum[Floor[1/GCD[i, n - i - k]], {i, k, Floor[(n - k)/2]}], {k, Floor[n/3]}], {n, 80}]

Formula

a(n) = Sum_{k=1..floor(n/3)} Sum_{i=k..floor((n-k)/2)} floor(1/gcd(i,n-i-k)).