Wolfram ResearchProductsPurchasingServices & ResourcesAbout UsOur Sites
Mathematica > Recurrence and Sum Functions >

LucasL

LucasL[n]
gives the Lucas number L_n.
  • Mathematical function, suitable for both symbolic and numerical manipulation.
  • The L_n satisfy the recurrence relation L_n=L_(n-1)+L_(n-2) with L_1=1, L_2=3.
  • For any complex value of n the L_n are given by the general formula L_n=(phi^n+cos(pi n)phi^(-n)), where phi is the golden ratio.
  • LucasL automatically threads over lists.
New in 6
© 2008 Wolfram Research, Inc. japanese.gif
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team