|
Search: id:A008595
|
|
| |
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 325
|
|
FORMULA
|
(floor(a(n)/10) + 4*(a(n) mod 10)) == 0 modulo 13, see A076310. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 06 2002
|
|
MAPLE
|
with(finance):seq(add(cashflows([4, 4, 5], 0), k=1..n), n=0..41); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 21 2008
|
|
CROSSREFS
|
Adjacent sequences: A008592 A008593 A008594 this_sequence A008596 A008597 A008598
Sequence in context: A044853 A044898 A048842 this_sequence A080196 A033025 A044838
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
