login

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

A163295
Binary order of n plus number of partitions of n-1.
1
1, 2, 4, 5, 8, 10, 14, 18, 26, 34, 46, 60, 81, 105, 139, 180, 236, 302, 390, 495, 632, 797, 1007, 1260, 1580, 1963, 2441, 3015, 3723, 4570, 5609, 6847, 8355, 10149, 12316, 14889, 17983, 21643, 26021, 31191, 37344, 44589, 53180, 63267, 75181, 89140
OFFSET
1,2
LINKS
FORMULA
a(n) = A029837(n) + A000041(n-1).
EXAMPLE
a(6)=10=3+7. a(7)=14=3+11. a(8)=18=3+15. a(9)=26=4+22.
MATHEMATICA
Table[Ceiling[Log[2, n]]+PartitionsP[n-1], {n, 50}] (* Harvey P. Dale, Oct 20 2012 *)
CROSSREFS
Cf. A000041 (number of partitions), A029837 (binary order).
Sequence in context: A092265 A262937 A249508 * A101274 A363446 A080222
KEYWORD
nonn,less
AUTHOR
EXTENSIONS
Indices in formula and definition corrected by R. J. Mathar, May 21 2010
STATUS
approved