id:A039767 - OEIS Search Results

Search: id:A039767

Displaying 1-1 of 1 results found.

page 1

GCD(phi(a(n)),a(n)-1) = number of prime factors of (a(n)-1).

+0
1

4, 6, 8, 10, 12, 14, 15, 18, 20, 24, 26, 27, 30, 32, 35, 38, 39, 42, 44, 48, 50, 51, 54, 55, 60, 62, 63, 68, 72, 74, 75, 80, 81, 82, 84, 87, 90, 95, 98, 99, 102, 104, 108, 110, 114, 119, 122, 123, 126, 128, 132, 135, 138, 140, 143, 147, 150, 152, 158, 159, 164, 168 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`phi(15)=8, gcd(8,14)=2, 14=2*7, 2 prime factors.`
	CROSSREFS	`Cf. A000010, A001221.` `Sequence in context: A090334 A078941 A078942 this_sequence A054023 A032583 A063127` `Adjacent sequences: A039764 A039765 A039766 this_sequence A039768 A039769 A039770`
	KEYWORD	`nonn,easy`
	AUTHOR	`Olivier Gerard (ogerard(AT)ext.jussieu.fr)`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research