login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A129139
a(n) = number of positive integers which are coprime to n and are <= d(n), where d(n) = A000005(n).
2
1, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 3, 2, 2, 3, 3, 2, 3, 3, 2, 2, 2, 3, 3, 2, 4, 3, 2, 2, 3, 3, 2, 2, 2, 3, 3, 2, 2, 3, 3, 2, 3, 3, 2, 3, 4, 3, 3, 2, 2, 3, 2, 2, 4, 4, 4, 3, 2, 3, 3, 2, 2, 4, 2, 2, 3, 3, 4, 3, 2, 4, 4, 2, 2, 3, 4, 2, 3, 4, 2, 3, 4, 3, 3, 2, 4, 4, 2, 3, 4, 4, 2, 3, 2, 4, 4
OFFSET
1,3
LINKS
EXAMPLE
d(16) = 5. So a(16) is the number of integers coprime to 16 which are <= 5. There are 3 such integers: 1, 3, 5; so a(16) = 3.
MAPLE
with(numtheory): a:=proc(n) local ct, j: ct:=0: for j from 1 to tau(n) do if gcd(j, n)=1 then ct:=ct+1 else fi od: ct; end: seq(a(n), n=1..140); # Emeric Deutsch, Apr 02 2007
PROG
(PARI) A129139(n) = sum(k=1, numdiv(n), (1==gcd(k, n))); \\ Antti Karttunen, Apr 01 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Leroy Quet, Mar 30 2007
EXTENSIONS
More terms from Emeric Deutsch, Apr 02 2007
STATUS
approved