31067

Appears in sequences

• a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 4) so far).at n=37A060731
• Number of partitions of n having positive odd rank (the rank of a partition is the largest part minus the number of parts).at n=47A101707
• Number of partitions of n into Fibonacci number of integer parts.at n=49A102848
• a(n) = least m such that m-th term of A128630 equals n.at n=12A128631