id:A077614 - OEIS Search Results

Search: id:A077614

Displaying 1-1 of 1 results found.

page 1

Let F(m,k) = the # of positive integers j<= m and GCD(j,k) = 1. Sequence gives a(n) = # of positive integers k : F(m,k)=k.

+0
2

1, 0, 1, 2, 0, 1, 1, 2, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 0, 1, 0, 0, 1, 2, 1, 1, 0, 1, 0, 1, 3, 3, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 2, 1, 1, 1, 0, 2, 3, 2, 1, 1, 0, 0, 1, 0, 2, 2, 1, 1, 1, 0, 1, 0, 0, 2, 3, 0, 2, 1, 0, 0, 0, 1, 3, 1, 0, 1, 2, 1, 0, 1, 0, 1, 2, 0, 0, 0, 0, 2, 2, 1, 2, 2, 1, 0, 1, 0, 1, 0 (list; graph; listen)

	OFFSET	`1,4`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	CROSSREFS	`Cf. A077615 (least inverse).` `Sequence in context: A035467 A024996 A134655 this_sequence A116948 A101660 A062984` `Adjacent sequences: A077611 A077612 A077613 this_sequence A077615 A077616 A077617`
	KEYWORD	`nonn`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net) and Leroy Quet, Nov 11 2002.`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research