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-2 of 2 results.

A247085 a(n) = A253174(2^n).

Original entry on oeis.org

1, 0, 0, 2, 4, 2, 10, 12, 34, 54, 128, 214, 444, 768, 1476, 2730, 5118, 9768, 18282, 34682, 65390, 123772, 236620
Offset: 0

Views

Author

Vladimir Shevelev, Jan 10 2015

Keywords

Comments

See comment in A253174.

Crossrefs

Extensions

More terms from Peter J. C. Moses, Jan 10 2015

A249482 Numbers n such that the summatory Liouville function L(n) (A002819) is zero and L(n-1)*L(n+1) = -1.

Original entry on oeis.org

2, 906150256, 906150308, 906150310, 906151576, 906154582, 906154586, 906154604, 906154606, 906154608, 906154758, 906154762, 906154764, 906154768, 906154770, 906154788, 906154794, 906154824, 906154826, 906154828, 906154830, 906154836, 906154838, 906154856
Offset: 1

Views

Author

Vladimir Shevelev, Jan 13 2015

Keywords

Comments

To create the data, the author studied the b-file of Donovan Johnson in A189229.
For k>=1,
in the interval [a(2k-1), a(2k)], L(n)<=0,
in the interval [a(2k), a(2k+1)], L(n)>=0.
In particular, for k=1, in the interval [2, 906150256], L(n)<=0.
G. Polya (1919) conjectured that L(n)<=0, for n>=2. But this was disproved in 1958 by B. Haselgrove, and in 1980 M. Tanaka found the smallest counterexample, a(2)+1 = 906150257.

Crossrefs

Showing 1-2 of 2 results.