Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089789
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A089789 Number of irreducible factors of Gauss polynomials. +0
2
0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 2, 2, 2, 0, 0, 1, 2, 2, 1, 0, 0, 3, 3, 4, 3, 3, 0, 0, 1, 3, 3, 3, 3, 1, 0, 0, 3, 3, 5, 4, 5, 3, 3, 0, 0, 2, 4, 4, 5, 5, 4, 4, 2, 0, 0, 3, 4, 6, 5, 7, 5, 6, 4, 3, 0, 0, 1, 3, 4, 5, 5, 5, 5, 4, 3, 1, 0, 0, 5, 5, 7, 7, 9, 7, 9, 7, 7, 5, 5, 0, 0, 1, 5, 5, 6, 7, 7, 7, 7, 6, 5, 5, 1, 0 (list; table; graph; listen)
OFFSET

0,12

COMMENT

T(n,k) is the number of irreducible factors of the (separable) polynomial [n]!/([k]![n-k]!). Here [n]! denotes the product of the first n quantum integers, the n-th quantum integer being defined as (1-q^n)/(1-q).

FORMULA

T(n, k)=T(n-1, k-1)+d(n)-d(k), where d(n) is the number of divisors of n.

EXAMPLE

T(8,3) equals the number of irreducible factors of (1-q^8)(1-q^7)(1-q^6)/((1-q^3)(1-q^2)(1-q)), which is a product of 5 cyclotomic polynomials in q, namely the 2nd, 4th, 6th, 7th and 8th. Thus T(8,3)=5.

CROSSREFS

Sequence in context: A123186 A127323 A132896 this_sequence A004541 A037864 A034852

Adjacent sequences: A089786 A089787 A089788 this_sequence A089790 A089791 A089792

KEYWORD

easy,nonn,tabl

AUTHOR

Paul Boddington (psb(AT)maths.warwick.ac.uk), Jan 09 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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research