A008595 Multiples of 13.

0, 13, 26, 39, 52, 65, 78, 91, 104, 117, 130, 143, 156, 169, 182, 195, 208, 221, 234, 247, 260, 273, 286, 299, 312, 325, 338, 351, 364, 377, 390, 403, 416, 429, 442, 455, 468, 481, 494, 507, 520, 533, 546, 559, 572, 585, 598, 611, 624, 637, 650, 663, 676

Offset

0,2

Comments

Complement of A113763. - Reinhard Zumkeller, Apr 26 2011

Links

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

Tanya Khovanova, Recursive Sequences

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 325

Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014.

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

Formula

(floor(a(n)/10) + 4*(a(n) mod 10)) == 0 modulo 13, see A076310. - Reinhard Zumkeller, Oct 06 2002

a(n) = 13*n = 2*a(n-1) - a(n-2). G.f.: 13x/(x-1)^2. - Vincenzo Librandi, Dec 24 2010

Maple

A008595:=n->13*n; seq(A008595(n), n=0..100); # Wesley Ivan Hurt, Jan 30 2014

Mathematica

Range[0, 1000, 13] (* Vladimir Joseph Stephan Orlovsky, May 29 2011 *)

Prog

(PARI) a(n)=13*n \\ Charles R Greathouse IV, Jul 10 2016

Crossrefs

Cf. A008594, A017533, A017545.

Sequence in context: A044853 A044898 A048842 * A080196 A033025 A044838

Adjacent sequences: A008592 A008593 A008594 * A008596 A008597 A008598

Keyword

nonn,easy

Author

N. J. A. Sloane

Status

approved