login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A225420 Least number a(n) such that the sum of the n Moebius function values beginning at a(n) reaches the maximum value A083544(n). 1
1, 14, 33, 32, 91, 141, 213, 212, 213, 3090, 3093, 3090, 3090, 3090, 38405, 38404, 3090, 3090, 38401, 38400, 294581, 294581, 39569681, 5571498 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..24.

EXAMPLE

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

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]]

CROSSREFS

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

Sequence in context: A155819 A120711 A018959 * A107484 A076329 A261560

Adjacent sequences:  A225417 A225418 A225419 * A225421 A225422 A225423

KEYWORD

nonn,hard,more

AUTHOR

T. D. Noe, May 07 2013

EXTENSIONS

a(23)-a(24) added by T. D. Noe, May 08 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 22 08:00 EDT 2019. Contains 328315 sequences. (Running on oeis4.)