This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A095768 a(n) = 2^(n+1) - n. 5
 3, 6, 13, 28, 59, 122, 249, 504, 1015, 2038, 4085, 8180, 16371, 32754, 65521, 131056, 262127, 524270, 1048557, 2097132, 4194283, 8388586, 16777193, 33554408, 67108839, 134217702, 268435429, 536870884, 1073741795, 2147483618 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Least k such that valuation(A004001(k),2) = n. Apart from initial term, row sums of triangle A135087. LINKS Index entries for linear recurrences with constant coefficients, signature (4, -5, 2). FORMULA From R. J. Mathar, Apr 30 2008: (Start) O.g.f.: -x(3-6x+4x^2)/((-1+x)^2*(-1+2x)). a(n) = 4a(n-1) - 5a(n-2) + 2a(n-3). (End) a(n) = A000247(n+1) + 3 = 2^(n+1) - n. - Martin Ettl, Nov 08 2012 MATHEMATICA Table[2^(n + 1) - n, {n, 0, 31}] (* Robert G. Wilson v Jun 12 2004 *) LinearRecurrence[{4, -5, 2}, {3, 6, 13}, 40] (* Harvey P. Dale, Jan 02 2012 *) PROG (Maxima) A095768(n):=2^(n+1)-n\$ makelist(A095768(n), n, 1, 30); /* Martin Ettl, Nov 08 2012 */ (PARI) a(n)=2^(n+1)-n \\ Charles R Greathouse IV, Oct 16 2015 CROSSREFS Cf. A004001, A095767, A132045. Sequence in context: A103788 A182137 A106461 * A002478 A106496 A052933 Adjacent sequences:  A095765 A095766 A095767 * A095769 A095770 A095771 KEYWORD nonn,easy AUTHOR Benoit Cloitre, Jun 05 2004 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.

Last modified March 21 22:19 EDT 2019. Contains 321382 sequences. (Running on oeis4.)