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
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, 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, 12, 33, 20, 4, 43, 21, 35, 19, 3, 50, 22, 38, 24, 50, 10, 19, 37 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

It appears that a(n) = A048864(A002808(n)). - Michel Marcus, Jul 14 2013

LINKS

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

FORMULA

a(n) = A048983(n) + 1. - Michel Marcus, Jul 14 2013

EXAMPLE

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

PROG

(PARI) ai(nn) = {forcomposite (n=1, nn, nb = 0; for(d=1, n-1, if (! isprime(d) && gcd(n, d) == 1, nb++)); print1(nb, ", "); ); } \\ Michel Marcus, Jul 14 2013

CROSSREFS

Cf. A000010, A048983, A002808.

Sequence in context: A136560 A105847 A240485 * A230120 A136531 A127318

Adjacent sequences:  A048981 A048982 A048983 * A048985 A048986 A048987

KEYWORD

easy,nonn

AUTHOR

Naohiro Nomoto

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 20 19:44 EDT 2018. Contains 316401 sequences. (Running on oeis4.)