%I #46 Apr 18 2017 07:03:01

%S 0,13,26,39,52,65,78,91,104,117,130,143,156,169,182,195,208,221,234,

%T 247,260,273,286,299,312,325,338,351,364,377,390,403,416,429,442,455,

%U 468,481,494,507,520,533,546,559,572,585,598,611,624,637,650,663,676

%N Multiples of 13.

%C Complement of A113763. - _Reinhard Zumkeller_, Apr 26 2011

%H Ivan Panchenko, <a href="/A008595/b008595.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 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=325">Encyclopedia of Combinatorial Structures 325</a>

%H Luis Manuel Rivera, <a href="http://arxiv.org/abs/1406.3081">Integer sequences and k-commuting permutations</a>, arXiv preprint arXiv:1406.3081 [math.CO], 2014.

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

%F (floor(a(n)/10) + 4*(a(n) mod 10)) == 0 modulo 13, see A076310. - _Reinhard Zumkeller_, Oct 06 2002

%F a(n) = 13*n = 2*a(n-1) - a(n-2). G.f.: 13x/(x-1)^2. - _Vincenzo Librandi_, Dec 24 2010

%p A008595:=n->13*n; seq(A008595(n), n=0..100); # _Wesley Ivan Hurt_, Jan 30 2014

%t Range[0, 1000, 13] (* _Vladimir Joseph Stephan Orlovsky_, May 29 2011 *)

%o (PARI) a(n)=13*n \\ _Charles R Greathouse IV_, Jul 10 2016

%Y Cf. A008594, A017533, A017545.

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_