login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A077614 Let F(m,k) be the number of positive integers j <= m such that gcd(j,k) = 1; then a(n) is the number of positive integers k such that F(n,k) = k. 1

%I #20 Nov 11 2019 21:43:49

%S 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,

%T 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,

%U 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

%N Let F(m,k) be the number of positive integers j <= m such that gcd(j,k) = 1; then a(n) is the number of positive integers k such that F(n,k) = k.

%Y Cf. A077615 (least inverse), A275257 (the F array).

%K nonn

%O 1,4

%A _Christian G. Bower_ and _Leroy Quet_, Nov 11 2002

%E Name edited by _Jon E. Schoenfield_, Oct 27 2019

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 17:25 EDT 2024. Contains 371254 sequences. (Running on oeis4.)