The OEIS is supported by the many generous donors to the OEIS Foundation.

Limit of the position distance between the n-th odd partition of odd numbers and its successor in the list of all integer partitions sorted in reverse lexicographic order; also first differences of A186130.

2

`%I #13 May 17 2015 13:24:34
`

`%S 3,5,3,9,3,2,4,17,3,2,7,3,5,32,3,2,6,3,3,10,3,4,6,58,3,2,6,3,3,13,4,3,
`

`%T 4,16,2,4,5,7,103,3,2,6,3,3,12,3,4,3,4,22,3,7,2,4,5,25,3,5,6,8,178,3,
`

`%U 2,6,3,3,12,3,4,3,4,24,5,3,7,2,4,5,36,3,2,4,13,3,5,6,35,3,4,6,7,9,299,3,2,6,3,3,12,3
`

`%N Limit of the position distance between the n-th odd partition of odd numbers and its successor in the list of all integer partitions sorted in reverse lexicographic order; also first differences of A186130.
`

`%H Alois P. Heinz, <a href="/A186203/b186203.txt">Table of n, a(n) for n = 1..10000</a>
`

`%e For a large odd number k the first partitions in reverse lexicographic order are [k], [k-1,1], [k-2,2], [k-2,1,1], ..., where only the partitions in positions 1, 4, ... consist of odd parts alone, thus a(1) = 4-1 = 3.
`

`%Y Cf. A186130.
`

`%K nonn,look
`

`%O 1,1
`

`%A _Alois P. Heinz_, Feb 14 2011
`