login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

G. C. Greubel, Table of n, a(n) for n = 1..1000

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 A080222 A050539

Adjacent sequences:  A163292 A163293 A163294 * A163296 A163297 A163298

KEYWORD

nonn,less

AUTHOR

Juri-Stepan Gerasimov, Jul 24 2009

EXTENSIONS

Indices in formula and definition corrected by R. J. Mathar, May 21 2010

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 16:24 EST 2019. Contains 329808 sequences. (Running on oeis4.)