|
Search: id:A130618
|
|
|
| A130618 |
|
a(1)=1. a(n+1) = sum{k=0 to a(n)(mod n)} a(n-k). |
|
+0
1
|
|
| 1, 1, 2, 4, 4, 12, 12, 35, 63, 63, 173, 368, 734, 1448, 2884, 5607, 11340, 16947, 39627, 79301, 118928, 271750, 543500, 1092066, 2184858, 4358317, 8727848, 17455759, 34911652, 61095259, 130918366, 244381036, 506138640, 1012353685, 2024551664
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
EXAMPLE
|
a(10)(mod 10) = 63(mod 10) = 3. So a(11) = sum{k=0 to 3} a(10-k) = a(10) + a(9) + a(8) + a(7) = 63 + 63 + 35 + 12 = 173.
|
|
MAPLE
|
a[1] := 1; for n to 35 do a[n+1] := add(a[n-k], k = 0 .. `mod`(a[n], n)) end do; seq(a[n], n = 1 .. 35); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 21 2007
|
|
CROSSREFS
|
Cf. A057176.
Sequence in context: A056415 A000936 A065449 this_sequence A129882 A129017 A086915
Adjacent sequences: A130615 A130616 A130617 this_sequence A130619 A130620 A130621
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Jun 18 2007
|
|
EXTENSIONS
|
More terms from Jon E. Schoenfield (jonscho(AT)hiwaay.net), Jun 21 2007
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 21 2007
|
|
|
Search completed in 0.002 seconds
|
