login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

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

%I

%S 0,4,14,32,77,192,452,1024,2299,5120,11270,24576,53241,114688,245768,

%T 524288,1114103,2359296,4980746,10485760,22020085,46137344,96469004,

%U 201326592,419430387,872415232,1811939342,3758096384,7784628209

%N 2^(n-1) times coefficient of x in (1+x)^n mod U(n,x), U the Chebyshev polynomials.

%F Apparently, a(n+1) = (n+1)2^n - (n+2)/4 * (I^n + (-I)^n).

%F 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

%Y Cf. A099586.

%K nonn

%O 1,2

%A _Ralf Stephan_, Oct 24 2004

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 January 23 04:16 EST 2020. Contains 331168 sequences. (Running on oeis4.)