login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A077614 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. 1
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; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Table of n, a(n) for n=1..105.

CROSSREFS

Cf. A077615 (least inverse).

Sequence in context: A262124 A199954 A219987 * A280379 A180793 A116948

Adjacent sequences:  A077611 A077612 A077613 * A077615 A077616 A077617

KEYWORD

nonn

AUTHOR

Christian G. Bower and Leroy Quet, Nov 11 2002.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 21:28 EDT 2019. Contains 328244 sequences. (Running on oeis4.)