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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A059938 Sum of binary numbers with n 1's and two (non-leading) 0's. 1
 0, 4, 31, 141, 506, 1590, 4593, 12523, 32740, 82908, 204755, 495561, 1179582, 2768818, 6422437, 14745495, 33554312, 75759480, 169869159, 378535765, 838860610, 1849687854, 4060086041, 8875147011, 19327352556, 41943039700 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Table of n, a(n) for n=0..25. Index entries for linear recurrences with constant coefficients, signature (9,-33,63,-66,36,-8). FORMULA a(n) = n^2*2^(n+1)-n*(n-1)/2 = A059937(n)-A059672(n) = A059937(n-1)+2^(n+1)*n*(n+1)/2. G.f.: x*(8*x^3-6*x^2-5*x+4) / ((x-1)^3*(2*x-1)^3). - Colin Barker, Sep 14 2014 EXAMPLE a(2)=31 since binary sum of 1100+1010+1001 is 12+10+9=31. PROG (PARI) concat(0, Vec(x*(8*x^3-6*x^2-5*x+4)/((x-1)^3*(2*x-1)^3) + O(x^100))) \\ Colin Barker, Sep 14 2014 CROSSREFS Cf. A059672, A059673, A059937. Sequence in context: A297501 A296734 A220284 * A263761 A263762 A263763 Adjacent sequences: A059935 A059936 A059937 * A059939 A059940 A059941 KEYWORD nonn,easy AUTHOR Henry Bottomley, Feb 13 2001 STATUS approved

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

Last modified February 25 13:12 EST 2024. Contains 370330 sequences. (Running on oeis4.)