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.

A238737 a(n) = 2*n+2 - A224911(n).

Original entry on oeis.org

0, 1, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 3, 5, 1, 1, 3, 5, 1, 3, 1, 1, 3, 1, 3, 5, 1, 3, 5, 1, 1, 3, 5, 1, 3, 1, 1, 3, 5, 1, 3, 1, 3, 5, 1, 3, 5, 7, 1, 3, 1, 1, 3, 1, 1, 3, 1, 3, 5, 7, 9, 11, 13, 1, 3, 1, 3, 5, 1, 1, 3, 5, 7, 9
Offset: 0

Views

Author

Paul Curtz, Mar 04 2014

Keywords

Comments

It appears that a(n+2) is successively either one 1 or a string of the odd numbers.
Conjecture: the rank of 1's is A005097(n+1). This is another link between Bernoulli numbers and primes via A190339(n).
Apparently (essentially) a duplicate of A049653. - R. J. Mathar, Mar 30 2014

Examples

			a(0)=2-2=0, a(1)=4-3=1, a(2)=6-5=1, a(3)=8-7=1, a(4)=10-7=3.
		

Crossrefs