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.

A051470 a(n) is least value of m for which the sum of Liouville's function from 1 to m is n.

Original entry on oeis.org

1, 906150258, 906150259, 906150260, 906150263, 906150264, 906150331, 906150334, 906150337, 906150338, 906150339, 906150358, 906150359, 906150362, 906150363, 906150368, 906150387, 906150388, 906150389, 906150406, 906150407
Offset: 1

Views

Author

Keywords

Comments

It was once conjectured that the sum of Liouville's function was never > 0 except for the first term.
It follows from Theorem 2 in Borwein-Ferguson-Mossinghoff that a(n) < 262*n^2 infinitely often, improving on an earlier result of Anderson & Stark. - Charles R Greathouse IV, Jun 14 2011
a(830) > 2 * 10^14 (probably around 3.511e14) and a(1160327) = 351753358289465 according to the calculations of Borwein, Ferguson, & Mossinghoff. - Charles R Greathouse IV, Jun 14 2011
3.75 * 10^14 < a(1160328) <= 23156359315279877168. - Hiroaki Yamanouchi, Oct 04 2015
From Jianing Song, Aug 06 2021: (Start)
a(n) is the smallest m such that A002819(m) = n.
This sequence is strictly increasing since A002819(m) - A002819(m-1) = A008836(m) = +-1. (End)

Examples

			The sum of Liouville's function from 1 through 906150258 is 2, that is the smallest value, so a(2)=906150258.
		

References

  • R. J. Anderson and H. M. Stark, Oscillation theorems, Analytic Number Theory (1980); Lecture Notes in Mathematics 899 (1981), pp. 79-106.

Crossrefs

Cf. A008836 (Liouville's function), A002819, A028488.

Programs

  • PARI
    print1(r=1);t=0;for(n=906150257,906400000,t+=(-1)^bigomega(n);if(t>r,r=t;print1(", "n))) \\ Charles R Greathouse IV, Jun 14 2011