powered by
Under OEIS A000032, the nth Lucas number is given as $$F_n = F_{n-1} + F_{n-2}$$ where the first 6 entries are 2, 1, 3, 4, 7, 11.
Lucas(n, Rmpfr = TRUE, PrecisionBits = 496)
the number of first n entries from the sequence.
n
a logical; TRUE to use large number representation, FALSE otherwise.
TRUE
FALSE
a positive integer for precision bits larger than 2.
a vector of length n containing first entries from the sequence.
Fibonacci
# NOT RUN { ## generate first 30 Lucas numbers first30 = Lucas(30) ## print without trailing 0's. print(first30, drop0trailing = TRUE) # }
Run the code above in your browser using DataLab