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.

A225420 a(n) is the least number k such that the sum of the n Moebius function values beginning at k reaches the maximum value A083544(n).

Original entry on oeis.org

1, 14, 33, 32, 91, 141, 213, 212, 213, 3090, 3093, 3090, 3090, 3090, 38405, 38404, 3090, 3090, 38401, 38400, 294581, 294581, 39569681, 5571498, 68780189, 294577, 68780189, 53758490, 92636277, 456742389, 1176172581, 880346227, 3953000577, 13821836609, 948481781, 948481780, 948481781, 5332819926, 35398246981, 35398246979
Offset: 1

Views

Author

T. D. Noe, May 07 2013

Keywords

Examples

			For n = 2, the 14 sums are 0, -2, -1, -1, 0, 0, -1, 0, 1, 0, -1, -1, 0, 2.
		

Crossrefs

Cf. A008683 (Moebius function), A083544 (maximum values of sums).

Programs

  • Mathematica
    mu = Table[MoebiusMu[i], {i, 1000000}]; t = Table[s = Total /@ Partition[mu, n, 1]; mx = Max[s]; pos = Position[s, mx, 1, 1][[1, 1]]; {mx, pos}, {n, 22}]; Transpose[t][[2]]

Extensions

a(23)-a(24) added by T. D. Noe, May 08 2013
More terms from Don Reble, Apr 21 2021