| 1, -1, -3, 1, -4, -24, -17, -25, -225, -215, -226, -2712, -2699, -2713, -40695, -40679, -40696, -732528, -732509, -732529, -15383109, -15383087, -15383110, -369194640, -369194615, -369194641, -9968255307, -9968255279, -9968255308, -299047659240, -299047659209, -299047659241, -9868572754953 (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 = -3; a(4) = -3 + 4 = 1. | | MATHEMATICA | FoldList[If[Mod[#2, 3]==2, #1-#2, If[Mod[#2, 3]==0, #1*#2, #1+#2]]&, 1, Range[2, 33]] (* James C. McMahon, Oct 09 2023 *) | | PROG | (Python) from itertools import count, islice def A362270_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