id:A056691 - OEIS Search Results

Search: id:A056691

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, 2, 2, 2, 1, 2, 3, 3, 2, 2, 3, 2, 2, 3, 4, 2, 2, 2, 3, 4, 2, 2, 4, 3, 2, 4, 4, 2, 3, 2, 5, 3, 2, 4, 5, 2, 2, 4, 5, 2, 1, 2, 4, 4, 2, 2, 6, 3, 3, 3, 4, 2, 3, 4, 6, 4, 2, 2, 5, 2, 2, 6, 6, 4, 3, 2, 4, 3, 3, 2, 7, 2, 2, 5, 4, 4, 2, 2, 7, 5, 2, 2, 5, 4, 2, 3, 6, 2, 5, 3, 4, 4, 2, 3, 7, 2, 3, 5, 5, 2, 3, 2, 6, 6 (list; graph; listen)

	OFFSET	`1,3`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	EXAMPLE	`The positive divisors of 8 are 1, 2, 4 and 8. (2+1), (4+1) and (8+1) are relatively prime to 8, so a(8) = 3.`
	CROSSREFS	`Sequence in context: A162545 A162544 A083647 this_sequence A130790 A029330 A132225` `Adjacent sequences: A056688 A056689 A056690 this_sequence A056692 A056693 A056694`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet Aug 10 2000`

page 1

Search completed in 0.002 seconds

Last modified November 25 14:49 EST 2009. Contains 167514 sequences.

AT&T Labs Research