Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116512
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116512 a(n) = number of positive integers each which is <= n and each which is divisible by exactly one prime dividing n (but is coprime to every other prime dividing n). a(1) = 0. +0
4
0, 1, 1, 2, 1, 3, 1, 4, 3, 5, 1, 6, 1, 7, 6, 8, 1, 9, 1, 10, 8, 11, 1, 12, 5, 13, 9, 14, 1, 14, 1, 16, 12, 17, 10, 18, 1, 19, 14, 20, 1, 20, 1, 22, 18, 23, 1, 24, 7, 25, 18, 26, 1, 27, 14, 28, 20, 29, 1, 28, 1, 31, 24, 32, 16, 32, 1, 34, 24, 34, 1, 36, 1, 37, 30, 38, 16, 38, 1, 40, 27, 41, 1 (list; graph; listen)
OFFSET

1,4

COMMENT

a(n) = number of m's, 1 <= m <= n, where GCD(m,n) is a power of a prime (>1).

We could also have taken a(1) = 1, but a(1) = 0 is better since there are no numbers <= 1 with the desired property. - N. J. A. Sloane (njas(AT)research.att.com), Sep 16 2006

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

12 is divisible by 2 and 3. The positive integers which are <= 12 and which are divisible by 2 or 3, but not by both 2 and 3, are: 2,3,4,8,9,10. Since there are six such integers, a(12) = 6.

MAPLE

with(numtheory): a:=proc(n) local c, j: c:=0: for j from 1 to n do if nops(factorset(gcd(j, n)))=1 then c:=c+1 else c:=c: fi od: c; end: seq(a(n), n=1..90); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 01 2006

MATHEMATICA

Table[Length@Select[GCD[n, Range@n], MatchQ[FactorInteger@#, {{_, _}}]&], {n, 93}] - Giovanni Resta (g.resta(AT)iit.cnr.it), Apr 04 2006

PROGRAM

(PARI) { for(n=1, 60, hav=0; for(i=1, n, g = gcd(i, n); d = factor(g); dec=matsize(d); if( dec[1] == 1, hav++; ); ); print1(hav, ", "); ); } - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 29 2006

CROSSREFS

Cf. A119790, A119794, A120499.

Sequence in context: A159353 A032742 A060654 this_sequence A075388 A036445 A098910

Adjacent sequences: A116509 A116510 A116511 this_sequence A116513 A116514 A116515

KEYWORD

nonn

AUTHOR

Leroy Quet Mar 23 2006

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Emeric Deutsch (deutsch(AT)duke.poly.edu) and Giovanni Resta (g.resta(AT)iit.cnr.it), Apr 01 2006

Edited by N. J. A. Sloane (njas(AT)research.att.com), Sep 16 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research