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.

A294263 Sum of the larger parts of the partitions of n into two parts with smaller part squarefree > 1.

Original entry on oeis.org

0, 0, 0, 2, 3, 7, 9, 11, 13, 20, 23, 32, 36, 47, 52, 57, 62, 67, 72, 87, 93, 110, 117, 124, 131, 151, 159, 181, 190, 214, 224, 234, 244, 271, 282, 293, 304, 334, 346, 358, 370, 403, 416, 451, 465, 502, 517, 532, 547, 562, 577, 618, 634, 650, 666, 682, 698
Offset: 1

Views

Author

Wesley Ivan Hurt, Oct 26 2017

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Sum[(n - i) MoebiusMu[i]^2, {i, 2, Floor[n/2]}], {n, 80}]

Formula

a(n) = Sum_{i=2..floor(n/2)} (n - i) * mu(i)^2, where mu is the Möbius function (A008683).