id:A067583 - OEIS Search Results

Search: id:A067583

Displaying 1-1 of 1 results found.

page 1

Integers of the form phi(n^n)/phi(n)^n where phi is the Euler totient function A000010(n).

+0
1

1, 2, 8, 243, 128, 177147, 32768, 129140163, 94143178827, 2147483648, 50031545098999707, 26588814358957503287787, 19383245667680019896796723, 9223372036854775808, 7509466514979724803946715958257547 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`If A007694(n)==0 (mod 3) (or equivalently if AOO7694(n) = 2^u*3^v with u, v >=1) then a(n) =3^(A007694(n) -1); if AOO7694(n)=2^u a(n)=2^(A007694(n) -1). Remark : if n=3^v phi(n^n)/phi(n)^n=1/2^(n-1)`
	CROSSREFS	`Sequence in context: A009588 A125264 A028985 this_sequence A120378 A012345 A012341` `Adjacent sequences: A067580 A067581 A067582 this_sequence A067584 A067585 A067586`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 30 2002`

page 1

Search completed in 0.002 seconds

Last modified July 6 17:22 EDT 2008. Contains 140988 sequences.

AT&T Labs Research