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

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; internal format)
OFFSET

1,2

FORMULA

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

CROSSREFS

Cf. A099586.

Sequence in context: A036486 A023627 A023649 * A078432 A124786 A011935

Adjacent sequences:  A099587 A099588 A099589 * A099591 A099592 A099593

KEYWORD

nonn

AUTHOR

Ralf Stephan, Oct 24 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 05:39 EST 2012. Contains 205860 sequences.