|
Search: id:A122397
|
|
|
| A122397 |
|
a(1)=1, a(2)=2, a(3)=3; for n >= 4, a(n) = the smallest positive integer not occurring earlier in the sequence such that GCD(a(n-2),a(n)) is a prime. |
|
+0
2
|
|
| 1, 2, 3, 4, 6, 10, 8, 5, 14, 15, 7, 9, 21, 12, 18, 22, 16, 11, 26, 33, 13, 24, 39, 27, 30, 42, 25, 20, 35, 34, 28, 17, 38, 51, 19, 36, 57, 46, 45, 23, 40, 69, 54, 48, 32, 50, 58, 44, 29, 55, 87, 60, 63, 62, 49, 31, 56, 93, 66, 72, 52, 70, 65, 64, 75, 74, 78, 37, 68, 111, 82, 81
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Sequence is probably a permutation of the positive integers.
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
MATHEMATICA
|
f[s_] := Block[{k = 1}, While[MemberQ[s, k] || ! PrimeQ[GCD[s[[ -2]], k]], k++ ]; Append[s, k] ]; Nest[f, {1, 2, 3}, 70] (*Chandler*)
|
|
CROSSREFS
|
Cf. A122398.
Sequence in context: A081419 A108858 A094859 this_sequence A047417 A066936 A067027
Adjacent sequences: A122394 A122395 A122396 this_sequence A122398 A122399 A122400
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet Aug 31 2006
|
|
EXTENSIONS
|
Corrected and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Sep 05 2006
|
|
|
Search completed in 0.002 seconds
|
