Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099590
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099590 2^(n-1) times coefficient of x in (1+x)^n mod U(n,x), U the Chebyshev polynomials. +0
1
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; listen)
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 this_sequence A078432 A124786 A011935

Adjacent sequences: A099587 A099588 A099589 this_sequence A099591 A099592 A099593

KEYWORD

nonn

AUTHOR

Ralf Stephan, Oct 24 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research