OFFSET
1,1
COMMENTS
Numbers n such that the last digit of F(n) is 2 where F(n) is the n-th Fibonacci number.
LINKS
Index entries for linear recurrences with constant coefficients, signature (1,0,0,1,-1).
FORMULA
Sequence contains numbers of the form: 3+60k, 36+60k, 54+60k, 57+60k, k>=0.
G.f.: 3*x*(1 + 11*x + 6*x^2 + x^3 + x^4) / ( (1+x)*(1+x^2)*(x-1)^2 ). - R. J. Mathar, Oct 08 2011
From Wesley Ivan Hurt, Jun 14 2016: (Start)
a(n) = a(n-1) + a(n-4) - a(n-5) for n>5.
a(n) = 15*n + 3*(1+i)*((1-i)*i^(2*n) - (5+2*i)*i^(-n) + (2+5*i)*i^n)/4 where i=sqrt(-1). (End)
MAPLE
A072682:=n->15*n+3*(1+I)*((1-I)*I^(2*n)-(5+2*I)*I^(-n)+(2+5*I)*I^n)/4: seq(A072682(n), n=1..100); # Wesley Ivan Hurt, Jun 14 2016
MATHEMATICA
Select[Range[800], MemberQ[{3, 36, 54, 57}, Mod[#, 60]]&] (* Harvey P. Dale, Apr 07 2013 *)
PROG
(Magma) [n: n in [0..800] | n mod 60 in [3, 36, 54, 57]]; // Bruno Berselli, Jun 14 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Benoit Cloitre, Aug 07 2002
EXTENSIONS
Simpler definition from Ralf Stephan, Jun 18 2005
STATUS
approved