login
A008601
Multiples of 19.
13
0, 19, 38, 57, 76, 95, 114, 133, 152, 171, 190, 209, 228, 247, 266, 285, 304, 323, 342, 361, 380, 399, 418, 437, 456, 475, 494, 513, 532, 551, 570, 589, 608, 627, 646, 665, 684, 703, 722, 741, 760, 779, 798, 817, 836, 855, 874, 893, 912, 931, 950, 969, 988
OFFSET
0,2
LINKS
Tanya Khovanova, Recursive Sequences
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014-2015.
FORMULA
(floor(a(n)/10) + 2*(a(n) mod 10)) == 0 modulo 19, see A076312. - Reinhard Zumkeller, Oct 06 2002
a(n) = 19*n = 2*a(n-1) - a(n-2). G.f.: 19x/(x-1)^2. - Vincenzo Librandi, Dec 24 2010
MATHEMATICA
Range[0, 1500, 19] (* Vladimir Joseph Stephan Orlovsky, Jun 01 2011 *)
PROG
(PARI) a(n)=19*n; \\ Michel Marcus, Dec 27 2014
CROSSREFS
Sequence in context: A164009 A235030 A048844 * A033900 A110288 A318260
KEYWORD
nonn,easy
STATUS
approved