Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102190
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102190 Triangle read by rows: coefficients of cycle index polynomial for the cyclic group C_n, Z(C_n,x), multiplied by n. +0
11
1, 1, 1, 1, 2, 1, 1, 2, 1, 4, 1, 1, 2, 2, 1, 6, 1, 1, 2, 4, 1, 2, 6, 1, 1, 4, 4, 1, 10, 1, 1, 2, 2, 2, 4, 1, 12, 1, 1, 6, 6, 1, 2, 4, 8, 1, 1, 2, 4, 8, 1, 16, 1, 1, 2, 2, 6, 6, 1, 18, 1, 1, 2, 4, 4, 8, 1, 2, 6, 12, 1, 1, 10, 10, 1, 22, 1, 1, 2, 2, 2, 4, 4, 8, 1, 4, 20, 1, 1, 12, 12, 1, 2, 6, 18, 1, 1, 2, 6, 6 (list; graph; listen)
OFFSET

1,5

COMMENT

Row n gives the coefficients of x[k]^{n/k} with increasing divisors k of n.

The length of row n is tau(n) = A000005(n) (number of divisors of n, including 1 and n).

REFERENCES

F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1994; pp. 181 and 184.

LINKS

W. Lang, More terms and comments.

Eric Weisstein's World of Mathematics, Cycle Index.

FORMULA

a(n, m)= phi(k(m)), m=1..tau(n), n>=1, with k(m) the m-th divisor of n, written in increasing order.

Z(C_n, x):=sum(sum(phi(k)*x[k]^{n/k}, k|n))/n, where phi(n)= A000010(n) (Euler's totient function) and k|n means 'k divides n'. Cf. Harary reference and MathWorld link.

EXAMPLE

[1], [1, 1], [1, 2], [1, 1, 2], [1, 4], [1, 1, 2, 2], [1, 6],...

Z(C_6,x)=(1*x[1]^6 + 1*x[2]^3 + 2*x[3]^2 + 2*x[6]^1)/6.

a(6,1)=phi(1)=1, a(6,2)=phi(2)=1, a(6,3)=phi(3)=2, a(6,4)=phi(6)=2.

CROSSREFS

Sequence in context: A033809 A046067 A132066 this_sequence A138650 A137843 A130194

Adjacent sequences: A102187 A102188 A102189 this_sequence A102191 A102192 A102193

KEYWORD

nonn,easy,tabf

AUTHOR

Wolfdieter Lang (wolfdieter.lang_AT_physik_DOT_uni-karlsruhe_DOT_de), Feb 15 2005

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research