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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048984 As n runs through composite numbers, a(n) = number of nonprime d < n such that GCD(d,n) = 1. 1

%I

%S 1,1,1,3,2,1,2,4,3,1,2,6,4,1,12,5,10,5,1,6,11,7,15,3,8,14,6,2,8,12,10,

%T 3,28,7,19,11,4,26,10,22,14,2,14,20,15,32,5,15,27,8,6,17,21,17,41,6,

%U 12,33,20,4,43,21,35,19,3,50,22,38,24,50,10,19,37

%N As n runs through composite numbers, a(n) = number of nonprime d < n such that GCD(d,n) = 1.

%e 9 is 4th composite number, GCD(9,1)=GCD(9,4)=GCD(9,8)=1, so a(4) = 3.

%Y Cf. A000010, A048983.

%K easy,nonn

%O 0,4

%A _Naohiro Nomoto_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 19 07:18 EDT 2013. Contains 225429 sequences.