|
| |
|
|
A008601
|
|
Multiples of 19.
|
|
6
| |
|
|
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
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
LINKS
| Tanya Khovanova, Recursive Sequences
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 331
|
|
|
FORMULA
| (floor(a(n)/10) + 2*(a(n) mod 10)) == 0 modulo 19, see A076312. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 06 2002
a(n)=19*n=2*a(n-1)-a(n-2). G.f.: 19x/(x-1)^2.[From Vincenzo Librandi, Dec 24 2010]
|
|
|
MATHEMATICA
| Range[0, 1500, 19] (* From Vladimir Joseph Stephan Orlovsky (4vladimir(AT)gmail.com), June 01 2011 *)
|
|
|
CROSSREFS
| Cf. A008599, A008600.
Sequence in context: A040342 A164009 A048844 * A033900 A110288 A050813
Adjacent sequences: A008598 A008599 A008600 * A008602 A008603 A008604
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
