A008597 Multiples of 15.

0, 15, 30, 45, 60, 75, 90, 105, 120, 135, 150, 165, 180, 195, 210, 225, 240, 255, 270, 285, 300, 315, 330, 345, 360, 375, 390, 405, 420, 435, 450, 465, 480, 495, 510, 525, 540, 555, 570, 585, 600, 615, 630, 645, 660, 675, 690, 705, 720, 735, 750, 765, 780

Offset

0,2

Comments

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

Links

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

Tanya Khovanova, Recursive Sequences.

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 327.

Index entries for linear recurrences with constant coefficients, signature (2,-1).

Formula

G.f.: 15*x/(1-x)^2. - Vincenzo Librandi, Jun 10 2013

From Elmo R. Oliveira, Apr 08 2025: (Start)

E.g.f.: 15*x*exp(x).

a(n) = A008585(A008587(n)) = A008587(A008585(n)) = A249674(n)/2. (End)

Mathematica

Range[0, 1005, 15] (* Vladimir Joseph Stephan Orlovsky, May 31 2011 *)
CoefficientList[Series[15 x / (x - 1)^2, {x, 0, 60}], x] (* Vincenzo Librandi, Jun 10 2013 *)

Prog

(Haskell)
a008597 = (* 15)
a008597_list = [0, 15 ..]  -- Reinhard Zumkeller, Mar 09 2013
(PARI) a(n)=15*n \\ Charles R Greathouse IV, Sep 24 2015

Crossrefs

Cf. A000045, A003893, A008585, A008587, A249674.

Sequence in context: A344332 A044855 A044900 * A161455 A033027 A044840

Adjacent sequences: A008594 A008595 A008596 * A008598 A008599 A008600

Keyword

nonn,easy

Author

N. J. A. Sloane

Status

approved