login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072703 Last digit of F(n) is 5 where F(n) is the n-th Fibonacci number. 1
5, 10, 20, 25, 35, 40, 50, 55, 65, 70, 80, 85, 95, 100, 110, 115, 125, 130, 140, 145, 155, 160, 170, 175, 185, 190, 200, 205, 215, 220, 230, 235, 245, 250, 260, 265, 275, 280, 290, 295, 305, 310, 320, 325, 335, 340, 350, 355, 365, 370, 380 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

FORMULA

Sequence contains numbers of the forms 5+60k, 10+60k, 20+60k, 25+60k, 35+60k, 40+60k, 50+60k, 55+60k, where k>=0.

a(n)=15*(n-1)-a(n-1), (with a(1)=5) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 08 2010]

a(0)=5, a(1)=10, a(2)=20, a(n)=a(n-1)+a(n-2)-a(n-3) [From Harvey P. Dale, May 15 2011]

a(n)=-(5/4)*(3+(-1)^n-6*n) [From Harvey P. Dale, May 15 2011]

EXAMPLE

a(2)=15*1-5=10; a(3)=15*2-10=20; a(4)=15*3-20=25: a(5)=15*4-25=35 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 08 2010]

MATHEMATICA

Flatten[Position[Fibonacci[Range[400]], _?(Last[IntegerDigits[#]]==5&)]] (* or *) LinearRecurrence[{1, 1, -1}, {5, 10, 20}, 60] (* or *) Table[-(5/4) (3+(-1)^n-6 n), {n, 60}] (* From Harvey P. Dale, May 15 2011 *)

CROSSREFS

Cf. A000045, A003893.

Sequence in context: A115774 A062052 A115799 * A086761 A045191 A065958

Adjacent sequences:  A072700 A072701 A072702 * A072704 A072705 A072706

KEYWORD

nonn,base

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 07 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 13:05 EST 2012. Contains 205789 sequences.