id:A054522 - OEIS Search Results

Search: id:A054522

Displaying 1-1 of 1 results found.

page 1

Triangle T(n,k): T(n,k) = phi(k) if k divides n, T(n,k)=0 otherwise (n >= 1, 1<=k<=n). T(n,k) = number of elements of order k in cyclic group of order n.

+0
20

1, 1, 1, 1, 0, 2, 1, 1, 0, 2, 1, 0, 0, 0, 4, 1, 1, 2, 0, 0, 2, 1, 0, 0, 0, 0, 0, 6, 1, 1, 0, 2, 0, 0, 0, 4, 1, 0, 2, 0, 0, 0, 0, 0, 6, 1, 1, 0, 0, 4, 0, 0, 0, 0, 4, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 1, 1, 2, 2, 0, 2, 0, 0, 0, 0, 0, 4, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 1, 1, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0 (list; table; graph; listen)

	OFFSET	`1,6`
	PROGRAM	`(PARI) T(n, k)=if(k<1\|k>n, 0, if(n%k, 0, eulerphi(k)))`
	CROSSREFS	`Cf. A054521.` `Sequence in context: A054009 A091297 A035183 this_sequence A110250 A065252 A115211` `Adjacent sequences: A054519 A054520 A054521 this_sequence A054523 A054524 A054525`
	KEYWORD	`nonn,tabl,nice`
	AUTHOR	`njas, Apr 09 2000`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research