login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A170981 Expansion of (Product_{i=1..m-1} (1 + x^(4*i-1))) * (1 + x^(2*m-1)) for m = 9. 1
1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 2, 3, 2, 1, 3, 4, 2, 2, 4, 4, 2, 2, 5, 4, 3, 3, 6, 4, 3, 4, 6, 5, 4, 5, 7, 5, 4, 5, 7, 6, 4, 7, 7, 6, 4, 7, 7, 6, 5, 8, 8, 6, 5, 8, 7, 6, 6, 8, 8, 6, 6, 7, 8, 5, 6, 8, 8, 5, 6, 7, 7, 4, 6, 7, 7, 4, 6, 7, 5, 4, 5, 7, 5, 4, 5, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,19
COMMENTS
(Product_{i=1..m-1} (1 + x^(4*i-1))) * (1 + x^(2*m-1)) is the Poincaré polynomial for O(2m).
REFERENCES
H. Weyl, The Classical Groups, Princeton, 1946, see p. 238.
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 0..153 (full sequence)
FORMULA
a(n) = a(153-n). - Rick L. Shepherd, Mar 02 2013
CROSSREFS
Sequence in context: A363850 A227481 A143654 * A161096 A214247 A211987
KEYWORD
nonn,fini,full,easy
AUTHOR
N. J. A. Sloane, Aug 29 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 6 11:44 EDT 2024. Contains 372293 sequences. (Running on oeis4.)