powered by
Under OEIS A000931, the nth Padovan number is given as $$F_n = F_{n-2} + F_{n-3}$$ where the first 6 entries are 1, 0, 0, 1, 0, 1.
Padovan(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.
# NOT RUN { ## generate first 30 Padovan numbers first30 = Padovan(30) ## print without trailing 0's. print(first30, drop0trailing = TRUE) # }
Run the code above in your browser using DataLab