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.

Showing 1-3 of 3 results.

A262042 First column of A261987.

Original entry on oeis.org

4, 8, 25, 91, 115, 527, 527, 1331, 1331, 4301, 15689, 14111, 19337, 31427, 175151, 175151, 175151, 175151, 175151
Offset: 1

Views

Author

Max Barrentine, Oct 02 2015

Keywords

Comments

The initial terms of the set of n coprime composite numbers that minimizes the difference between the first and last terms, and then minimizes the average of the terms.

Crossrefs

Subsequence of A002808.
First column of A261987.

A260652 The minimal difference between the first and last terms of a set of n coprime numbers.

Original entry on oeis.org

0, 1, 2, 4, 6, 8, 12, 14, 18, 20, 24, 30, 32, 36, 38, 42, 48, 50, 56, 60, 62, 68, 72, 78, 84, 86, 90, 94, 98, 102, 108, 114, 120, 126, 130, 136, 140, 146, 150, 156, 158, 162, 168, 174, 180, 182
Offset: 1

Views

Author

Max Barrentine, Nov 25 2015

Keywords

Comments

a(n>3) <= prime(n-2) + 1.

Crossrefs

Extensions

a(33)-a(39) from Max Barrentine, Apr 26 2016
a(40)-a(46) from Max Barrentine, Jun 23 2016

A261927 Sum of the larger parts of the partitions of n into two squarefree parts.

Original entry on oeis.org

0, 1, 2, 5, 3, 8, 11, 18, 13, 12, 16, 34, 28, 31, 37, 63, 50, 56, 44, 88, 59, 83, 73, 129, 93, 91, 100, 138, 105, 103, 123, 195, 151, 173, 169, 303, 201, 199, 219, 345, 255, 256, 298, 442, 341, 274, 289, 482, 380, 294, 255, 525, 401, 410, 270, 539, 422, 487
Offset: 1

Views

Author

Wesley Ivan Hurt, Oct 02 2015

Keywords

Examples

			a(4) = 5. There are two partitions of 4 into two squarefree parts: (3, 1) and (2, 2). The sum of the larger parts of these partitions is 3 + 2 = 5.
a(5) = 3. There is only one partition of 5 into two squarefree parts: (3, 2). The larger part is 3, thus a(5) = 3.
		

Crossrefs

Programs

  • Maple
    with(numtheory): A261987:=n->add((n-i)*mobius(i)^2*mobius(n-i)^2, i=1..floor(n/2)): seq(A261987(n), n=1..70);
  • Mathematica
    Table[Sum[(n - i) MoebiusMu[i]^2 * MoebiusMu[n - i]^2, {i, Floor[n/2]}], {n, 70}]
    Table[Total[Select[IntegerPartitions[n,{2}],AllTrue[#,SquareFreeQ]&][[All,1]]],{n,60}] (* Harvey P. Dale, Apr 26 2022 *)

Formula

a(n) = Sum_{i = 1..floor(n/2)} ((n - i) * mu(i)^2 * mu(n - i)^2), where mu is the Möbius function (A008683).
a(n) = A262351(n) - A261985(n).
Showing 1-3 of 3 results.