|
Search: id:A008601
|
|
| |
|
| 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
(list; graph; listen)
|
|
|
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
|
|
MAPLE
|
with(finance):seq(add(cashflows( [7, 7, 5], 0 ), k=1..n), n=0..40); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 21 2008
|
|
CROSSREFS
|
Sequence in context: A040342 A164009 A048844 this_sequence A033900 A110288 A050813
Adjacent sequences: A008598 A008599 A008600 this_sequence A008602 A008603 A008604
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
