Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #46 Apr 18 2017 07:03:02
%S 0,15,30,45,60,75,90,105,120,135,150,165,180,195,210,225,240,255,270,
%T 285,300,315,330,345,360,375,390,405,420,435,450,465,480,495,510,525,
%U 540,555,570,585,600,615,630,645,660,675,690,705,720,735,750,765,780
%N Multiples of 15.
%C n such that the last decimal digit of F(n) is zero, where F(n) is the n-th Fibonacci number ( F(45) = 1134903170 ). - _Benoit Cloitre_, Aug 07 2002
%H Vincenzo Librandi, <a href="/A008597/b008597.txt">Table of n, a(n) for n = 0..1000</a>
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=327">Encyclopedia of Combinatorial Structures 327</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2, -1).
%F G.f.: 15*x/(1-x)^2. - _Vincenzo Librandi_, Jun 10 2013
%t Range[0, 1005, 15] (* _Vladimir Joseph Stephan Orlovsky_, May 31 2011 *)
%t CoefficientList[Series[15 x / (x - 1)^2, {x, 0, 60}], x] (* _Vincenzo Librandi_, Jun 10 2013 *)
%o (Haskell)
%o a008597 = (* 15)
%o a008597_list = [0, 15 ..] -- _Reinhard Zumkeller_, Mar 09 2013
%o (PARI) a(n)=15*n \\ _Charles R Greathouse IV_, Sep 24 2015
%Y Cf. A000045, A003893.
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_