|
Search: id:A118310
|
|
|
| A118310 |
|
a(n) = GCD(n,m(n)), where m(n) is the n-th nonprime positive integer (1 or composite). |
|
+0
1
|
|
| 1, 2, 3, 4, 1, 2, 1, 2, 3, 2, 1, 4, 1, 2, 3, 1, 1, 9, 1, 10, 1, 11, 1, 1, 1, 2, 3, 4, 1, 2, 1, 2, 3, 1, 5, 3, 1, 2, 1, 8, 1, 2, 1, 2, 9, 2, 1, 6, 1, 1, 1, 4, 1, 3, 1, 7, 3, 2, 1, 2, 1, 1, 1, 1, 1, 6, 1, 4, 3, 2, 1, 24, 1, 1, 25, 2, 1, 3, 1, 4, 1, 1, 1, 6, 5, 2, 3, 2, 1, 30, 1, 2, 3, 2, 5, 6, 1, 1, 1, 4, 1, 2, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
For n >= 1, a(n+1) = GCD(n+1,c(n)), where c(n) = the n-th composite.
First occurrence of k: 1, 2, 3, 4, 35, 48, 56, 40, 18, 20, 22, 120, 130, 140, 375, ..., . - Robert G. Wilson v.
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
MATHEMATICA
|
NonPrime[n_Integer] := FixedPoint[n + PrimePi@# &, n + PrimePi@n]; f[n_] := GCD[n, NonPrime@n]; Array[f, 103] - Robert G. Wilson v
|
|
PROGRAM
|
(PARI) A002808(maxn)= { local(a); a=[4]; for(n=5, maxn, if( !isprime(n), a=concat(a, n); ); ); return(a); } A118310(maxn)= { local(nonppo, a, newa, nonppol); a=[; ]; nonppo=concat(1, A002808(maxn)); nonppol=matsize(nonppo); for(n=1, nonppol[2], newa= gcd(n, nonppo[n]); a=concat(a, newa); ); return(a); } print(A118310(180)); (Mathar)
|
|
CROSSREFS
|
Cf. A064814.
Sequence in context: A138297 A139458 A104412 this_sequence A073057 A084310 A078978
Adjacent sequences: A118307 A118308 A118309 this_sequence A118311 A118312 A118313
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet May 14 2006
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(at)rgwv.com) and R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 16 2006
|
|
|
Search completed in 0.002 seconds
|
