A008599 Multiples of 17.

0, 17, 34, 51, 68, 85, 102, 119, 136, 153, 170, 187, 204, 221, 238, 255, 272, 289, 306, 323, 340, 357, 374, 391, 408, 425, 442, 459, 476, 493, 510, 527, 544, 561, 578, 595, 612, 629, 646, 663, 680, 697, 714, 731, 748, 765, 782, 799, 816, 833, 850, 867, 884

Offset

0,2

Links

Ivan Panchenko, Table of n, a(n) for n = 0..200

Tanya Khovanova, Recursive Sequences

Michael Penn, Divisibility by 17: The Lesser Known Rule, YouTube video, 2023.

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 329

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

Formula

(floor(a(n)/10) - 5*(a(n) mod 10)) == 0 (mod 17), see A076311. - Reinhard Zumkeller, Oct 06 2002

From Vincenzo Librandi, Dec 24 2010: (Start)

a(n) = 17*n = 2*a(n-1) - a(n-2).

G.f.: 17x/(x-1)^2. (End)

Mathematica

Range[0, 1003, 17] (* Vladimir Joseph Stephan Orlovsky, Jun 01 2011 *)

Prog

(PARI) a(n)=17*n \\ Charles R Greathouse IV, Oct 07 2015
(Scala) for (n <- 0 to 1003 by 17) print(n + ", ") // Alonso del Arte, Jun 17 2018

Crossrefs

Cf. A008597, A008598, A244630.

Sequence in context: A161440 A044902 A048843 * A033029 A044842 A033014

Adjacent sequences: A008596 A008597 A008598 * A008600 A008601 A008602

Keyword

nonn,easy

Author

N. J. A. Sloane

Status

approved