id:A056692 - OEIS Search Results

Search: id:A056692

Displaying 1-1 of 1 results found.

page 1

Number of divisors k of n with GCD(k-1, n) = 1.

+0
1

1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 3, 1, 2, 3, 4, 1, 3, 1, 4, 2, 2, 1, 5, 2, 2, 3, 4, 1, 2, 1, 5, 3, 2, 3, 5, 1, 2, 2, 6, 1, 4, 1, 4, 5, 2, 1, 6, 2, 3, 3, 4, 1, 4, 2, 5, 2, 2, 1, 5, 1, 2, 4, 6, 3, 3, 1, 4, 3, 4, 1, 8, 1, 2, 4, 4, 3, 4, 1, 7, 4, 2, 1, 6, 3, 2, 3, 6, 1, 4, 3, 4, 2, 2, 3, 8, 1, 3, 5, 6, 1, 3, 1, 6, 4 (list; graph; listen)

	OFFSET	`1,4`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	EXAMPLE	`The positive divisors of 8 are 1, 2, 4, 8. (2-1), (4-1) and (8-1) are relatively prime to 8, so a(8) = 3.`
	CROSSREFS	`Sequence in context: A069248 A008481 A127669 this_sequence A039637 A069157 A076526` `Adjacent sequences: A056689 A056690 A056691 this_sequence A056693 A056694 A056695`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet, Aug 10 2000`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research