This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A008597 #49 Apr 08 2025 16:05:47
%S A008597 0,15,30,45,60,75,90,105,120,135,150,165,180,195,210,225,240,255,270,
%T A008597 285,300,315,330,345,360,375,390,405,420,435,450,465,480,495,510,525,
%U A008597 540,555,570,585,600,615,630,645,660,675,690,705,720,735,750,765,780
%N A008597 Multiples of 15.
%C A008597 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 A008597 Vincenzo Librandi, <a href="/A008597/b008597.txt">Table of n, a(n) for n = 0..1000</a>
%H A008597 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>.
%H A008597 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=327">Encyclopedia of Combinatorial Structures 327</a>.
%H A008597 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A008597 G.f.: 15*x/(1-x)^2. - _Vincenzo Librandi_, Jun 10 2013
%F A008597 From _Elmo R. Oliveira_, Apr 08 2025: (Start)
%F A008597 E.g.f.: 15*x*exp(x).
%F A008597 a(n) = A008585(A008587(n)) = A008587(A008585(n)) = A249674(n)/2. (End)
%t A008597 Range[0, 1005, 15] (* _Vladimir Joseph Stephan Orlovsky_, May 31 2011 *)
%t A008597 CoefficientList[Series[15 x / (x - 1)^2, {x, 0, 60}], x] (* _Vincenzo Librandi_, Jun 10 2013 *)
%o A008597 (Haskell)
%o A008597 a008597 = (* 15)
%o A008597 a008597_list = [0, 15 ..] -- _Reinhard Zumkeller_, Mar 09 2013
%o A008597 (PARI) a(n)=15*n \\ _Charles R Greathouse IV_, Sep 24 2015
%Y A008597 Cf. A000045, A003893, A008585, A008587, A249674.
%K A008597 nonn,easy
%O A008597 0,2
%A A008597 _N. J. A. Sloane_