OFFSET
1,2
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..1430
J. D. Fulton and W. L. Morris, On arithmetical functions related to the Fibonacci numbers, Acta Arithmetica, 16 (1969), 105-110.
Wikipedia, Pisano period
Index entries for linear recurrences with constant coefficients, signature (5).
FORMULA
From Colin Barker, Jan 16 2014: (Start)
a(n) = 24*5^(n-2) for n > 1.
a(n) = 5*a(n-1) for n > 2.
G.f.: -x*(19*x+1) / (5*x-1). (End)
MATHEMATICA
LinearRecurrence[{5}, {1, 24}, 30] (* or *) Join[{1}, NestList[5#&, 24, 30]] (* Harvey P. Dale, May 07 2017 *)
PROG
(Haskell)
a235702 n = if n == 1 then 1 else 24 * 5 ^ (n - 2)
a235702_list = 1 : iterate (* 5) 24
(PARI)
Vec(-x*(19*x+1)/(5*x-1) + O(x^100)) \\ Colin Barker, Jan 16 2014
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Reinhard Zumkeller, Jan 15 2014
STATUS
approved