This site is supported by donations to The OEIS Foundation.

 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!)
 A099590 2^(n-1) times coefficient of x in (1+x)^n mod U(n,x), U the Chebyshev polynomials. 0
 0, 4, 14, 32, 77, 192, 452, 1024, 2299, 5120, 11270, 24576, 53241, 114688, 245768, 524288, 1114103, 2359296, 4980746, 10485760, 22020085, 46137344, 96469004, 201326592, 419430387, 872415232, 1811939342, 3758096384, 7784628209 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA Apparently, a(n+1) = (n+1)2^n - (n+2)/4 * (I^n + (-I)^n). Empirical g.f.: x^2*(x+2)*(x^2-2*x+2) / ((2*x-1)^2*(x^2+1)^2). - Colin Barker, Jul 16 2013 CROSSREFS Cf. A099586. Sequence in context: A023649 A323723 A324042 * A078432 A124786 A322009 Adjacent sequences:  A099587 A099588 A099589 * A099591 A099592 A099593 KEYWORD nonn AUTHOR Ralf Stephan, Oct 24 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 December 5 10:45 EST 2019. Contains 329751 sequences. (Running on oeis4.)