A362269 | | a(1) = 1, then subtract, add, and multiply 2, 3, 4; 5, 6, 7; ... in that order. | | 7 |
|
| 1, -1, 2, 8, 3, 9, 63, 55, 64, 640, 629, 641, 8333, 8319, 8334, 133344, 133327, 133345, 2533555, 2533535, 2533556, 55738232, 55738209, 55738233, 1393455825, 1393455799, 1393455826, 39016763128, 39016763099, 39016763129 (list; graph; refs; listen; history; edit; text; internal format) |
|
| OFFSET | 1,3 | | LINKS | | | FORMULA | a(1)=1; for n > 1, a(n) = a(n-1) - n if n mod 3 = 2, a(n-1) + n if n mod 3 = 0, a(n-1) * n if n mod 3 = 1. | | EXAMPLE | a(2) = 1 - 2 = -1; a(3) = -1 + 3 = 2; a(4) = 2 * 4 = 8. | | MATHEMATICA | FoldList[If[Mod[#2, 3]==2, #1-#2, If[Mod[#2, 3]==0, #1+#2, #1*#2]]&, 1, Range[2, 30]] (* James C. McMahon, Oct 08 2023 *) | | PROG | (Python) from itertools import count, islice def A362269_gen(): # generator of terms yield (a:=1) for n in count(2, 3): yield (a:=a-n) yield (a:=a+n+1) yield (a:=a*(n+2)) | | CROSSREFS | | | KEYWORD | sign | | AUTHOR | | | STATUS | approved |
|
|
No comments:
Post a Comment