A008599 - OEIS

%I #49 Jan 18 2023 02:46:57

%S 0,17,34,51,68,85,102,119,136,153,170,187,204,221,238,255,272,289,306,

%T 323,340,357,374,391,408,425,442,459,476,493,510,527,544,561,578,595,

%U 612,629,646,663,680,697,714,731,748,765,782,799,816,833,850,867,884

%N Multiples of 17.

%H Ivan Panchenko, <a href="/A008599/b008599.txt">Table of n, a(n) for n = 0..200</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H Michael Penn, <a href="https://www.youtube.com/watch?v=eEw6zxDTZbc">Divisibility by 17: The Lesser Known Rule</a>, YouTube video, 2023.

%H INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=329">Encyclopedia of Combinatorial Structures 329</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2, -1).

%F (floor(a(n)/10) - 5*(a(n) mod 10)) == 0 (mod 17), see A076311. - _Reinhard Zumkeller_, Oct 06 2002

%F From _Vincenzo Librandi_, Dec 24 2010: (Start)

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

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

%t Range[0, 1003, 17] (* _Vladimir Joseph Stephan Orlovsky_, Jun 01 2011 *)

%o (PARI) a(n)=17*n \\ _Charles R Greathouse IV_, Oct 07 2015

%o (Scala) for (n <- 0 to 1003 by 17) print(n + ", ") // _Alonso del Arte_, Jun 17 2018

%Y Cf. A008597, A008598, A244630.

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_