A008601 Multiples of 19.
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
Links
- Ivan Panchenko, Table of n, a(n) for n = 0..200
- Tanya Khovanova, Recursive Sequences.
- INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 331.
- Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014-2015.
- Index entries for linear recurrences with constant coefficients, signature (2,-1).
Programs
-
Mathematica
Range[0, 1500, 19] (* Vladimir Joseph Stephan Orlovsky, Jun 01 2011 *)
-
PARI
a(n)=19*n; \\ Michel Marcus, Dec 27 2014
Formula
(floor(a(n)/10) + 2*(a(n) mod 10)) == 0 modulo 19, see A076312. - Reinhard Zumkeller, Oct 06 2002
From Vincenzo Librandi, Dec 24 2010: (Start)
a(n) = 19*n.
a(n) = 2*a(n-1) - a(n-2).
G.f.: 19*x/(x-1)^2. (End)
From Elmo R. Oliveira, Apr 10 2025: (Start)
E.g.f.: 19*x*exp(x).