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).

This page as a plain text file.
%I A238737 #12 Mar 31 2014 15:50:03
%S A238737 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,
%T A238737 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,
%U A238737 5,1,1,3,5,7,9
%N A238737 a(n) = 2*n+2 - A224911(n).
%C A238737 It appears that a(n+2) is successively either one 1 or a string of the odd numbers.
%C A238737 Conjecture: the rank of 1's is A005097(n+1). This is another link between Bernoulli numbers and primes via A190339(n).
%C A238737 Apparently (essentially) a duplicate of A049653. - _R. J. Mathar_, Mar 30 2014
%e A238737 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.
%Y A238737 Cf. A060308, A005408.
%K A238737 nonn
%O A238737 0,5
%A A238737 _Paul Curtz_, Mar 04 2014