|
|
A077384
|
|
a(1) = 1, then add, multiply, subtract, multiply 2, 3, 4, 5; 6, 7, 8, 9; ... in that order.
|
|
2
|
|
|
1, 3, 9, 5, 25, 31, 217, 209, 1881, 1891, 20801, 20789, 270257, 270271, 4054065, 4054049, 68918833, 68918851, 1309458169, 1309458149, 27498621129, 27498621151, 632468286473, 632468286449, 15811707161225, 15811707161251
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
a(1) = 1, a(2n+1) = (2n+1)*a(2n), a(4n) = a(4n-1)-4n, a(4n+2) = a(4n+1) + 4n+2.
|
|
MATHEMATICA
|
FoldList[If[Mod[#2, 4]==2, #1+#2, If[Mod[#2, 4]==3, #1*#2, If[Mod[#2, 4] ==0, #1-#2, #1*#2]]]&, 1, Range[2, 26]] (* James C. McMahon, Oct 09 2023 *)
|
|
PROG
|
(Python)
from itertools import count, islice
def A077384_gen(): # generator of terms
yield (a:=1)
for n in count(2, 4):
yield (a:=a+n)
yield (a:=a*(n+1))
yield (a:=a-n-2)
yield (a:=a*(n+3))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|