Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 May 17 2015 13:27:04
%S 3,2,6,3,3,12,3,4,3,4,23,3,5,3,7,2,4,5,43,3,5,3,8,3,2,4,13,3,5,6,78,3,
%T 5,3,9,3,2,4,15,2,7,3,5,19,3,4,6,7,136,3,5,3,9,3,2,4,16,3,2,7,3,5,27,
%U 3,3,10,3,4,6,28,2,4,5,7,8,232,3,5,3,9,3,2,4,17,3,2,7,3,5,30,2,6,3,3,10,3,4,6,46,4
%N Limit of the position distance between the n-th odd partition of even numbers and its successor in the list of all integer partitions sorted in reverse lexicographic order; also first differences of A186131.
%H Alois P. Heinz, <a href="/A186204/b186204.txt">Table of n, a(n) for n = 1..10000</a>
%e For a large even number k the first partitions in reverse lexicographic
%e order are [k], [k-1,1], [k-2,2], [k-2,1,1], [k-3,3] ..., where only the
%e partitions in positions 2, 5, ... consist of odd parts alone, thus
%e a(1) = 5-2 = 3.
%Y Cf. A186131.
%K nonn,look
%O 1,1
%A _Alois P. Heinz_, Feb 14 2011