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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A170983 Expansion of (Product_{i=1..m-1} (1 + x^(4*i-1))) * (1 + x^(2*m-1) for m = 11. 1
1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 2, 1, 0, 2, 2, 1, 1, 1, 3, 1, 1, 2, 3, 2, 1, 3, 4, 2, 2, 4, 4, 3, 2, 5, 6, 2, 3, 7, 5, 3, 4, 8, 6, 3, 6, 9, 6, 5, 7, 11, 7, 5, 10, 11, 7, 7, 10, 12, 9, 7, 13, 13, 9, 9, 14, 14, 10, 10, 17, 14, 11, 12, 17, 16, 11, 13, 20, 15, 12, 16, 19, 17, 13, 17 (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..231 (full sequence)

FORMULA

a(n) = a(231-n). - Rick L. Shepherd, Mar 02 2013

CROSSREFS

Sequence in context: A068913 A128306 A305152 * A113423 A131258 A298596

Adjacent sequences:  A170980 A170981 A170982 * A170984 A170985 A170986

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 27 15:44 EDT 2021. Contains 347691 sequences. (Running on oeis4.)