|
|
A251608
|
|
Lexicographically earliest subsequence of the Fibonacci numbers (cf. A000045), such that gcd(a(n-2), a(n)) > 1 and gcd(a(n-1), a(n)) = 1.
|
|
2
|
|
|
2, 3, 8, 21, 34, 987, 2584, 6765, 10946, 75025, 196418, 9227465, 14930352, 7778742049, 20365011074, 225851433717, 365435296162, 10610209857723, 27777890035288, 72723460248141, 117669030460994, 3416454622906707, 8944394323791464, 23416728348467685
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
---+--------+----------------+----------------
1 | 2 | 3 | 2
2 | 3 | 4 | 3
3 | 8 | 6 | 6
4 | 21 | 8 | 17
5 | 34 | 9 | 35
6 | 987 | 16 | 776
7 | 2584 | 18 | 2755
8 | 6765 | 20 | 5707
9 | 10946 | 21 | 11652
10 | 75025 | 25 | 66539
|
|
PROG
|
(Haskell)
a251608 n = a251608_list !! (n-1)
a251608_list = 2 : 3 : f 2 3 (drop 5 a000045_list) where
f u v (w:ws) = if gcd u w > 1 && gcd v w == 1
then w : f v w ws else f u v ws
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|