The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A072675 Last digit of F(n) is 1 where F(n) is the n-th Fibonacci number. 3
 1, 2, 8, 19, 22, 28, 41, 59, 61, 62, 68, 79, 82, 88, 101, 119, 121, 122, 128, 139, 142, 148, 161, 179, 181, 182, 188, 199, 202, 208, 221, 239, 241, 242, 248, 259, 262, 268, 281, 299, 301, 302, 308, 319, 322, 328, 341, 359, 361, 362, 368, 379, 382, 388, 401 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,1,-1). FORMULA Sequence contains numbers of form (1+60k) (2+60k) (8+60k) (19+60k) (22+60k) (28+60k) (41+60k) (59+60k) k>=0. G.f.: x*(x^8+18*x^7+13*x^6+6*x^5+3*x^4+11*x^3+6*x^2+x+1) / (x^9-x^8-x+1). - Colin Barker, Jun 16 2013 EXAMPLE F(28) = 317811 MATHEMATICA Position[Fibonacci[Range[500]], _?(Mod[#, 10]==1&)]//Flatten (* or *) LinearRecurrence[{1, 0, 0, 0, 0, 0, 0, 1, -1}, {1, 2, 8, 19, 22, 28, 41, 59, 61}, 70] (* Harvey P. Dale, Sep 17 2018 *) CROSSREFS Cf. A000045, A003893. Sequence in context: A058217 A306616 A183183 * A033711 A093012 A049525 Adjacent sequences:  A072672 A072673 A072674 * A072676 A072677 A072678 KEYWORD nonn,base,easy AUTHOR Benoit Cloitre, Aug 07 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 18 23:16 EDT 2021. Contains 347548 sequences. (Running on oeis4.)