The real sequence is indexed from 0 with a_n=(-3)+(-1)n. List the prefix [a_0,…,a_(L-1)] of length L=2; use [] when L=0.
G001 — The real sequence is indexed from 0 with a_n=(-3)+(-1)n. List the prefix [a_0,…,a_(L-1)] of length L=2; use [] when L=0.
Definition and scope
Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate.
Keep EACH bank’s keys/operation/domain distinct:LDL/PULSE/function legacy table underscores,TREE full tree_* with its declared domain,and permissive BASE signed without invented op/domain.All arithmetic respects the binary-primitive contract.
Type ALL RAW u/d/count fields EVEN for prefix L=0.Indices start at0 and the formula/recurrence is GIVEN;do not infer a general rule from finite samples.
Sequence prefix ORIGINAL index times step j=0 := mul(0, -1)
After
Sequence prefix ORIGINAL index times step j=0 = 0
Conditions: none
Use ORIGINAL operands exactly;mul/sub/div have EXPLICITLY TWO operands so the old binary primitive cannot ignore a third.Keep RAW SAFE bounds separate from unbounded derived BigInts;do not approximate to force answers.
Sequence prefix ORIGINAL complete term j=0 := sum(-3, 0)
After
Sequence prefix ORIGINAL complete term j=0 = -3
Conditions: none
Use ORIGINAL operands exactly;mul/sub/div have EXPLICITLY TWO operands so the old binary primitive cannot ignore a third.Keep RAW SAFE bounds separate from unbounded derived BigInts;do not approximate to force answers.
Sequence prefix ORIGINAL index times step j=1 := mul(1, -1)
After
Sequence prefix ORIGINAL index times step j=1 = -1
Conditions: none
Use ORIGINAL operands exactly;mul/sub/div have EXPLICITLY TWO operands so the old binary primitive cannot ignore a third.Keep RAW SAFE bounds separate from unbounded derived BigInts;do not approximate to force answers.
Sequence prefix ORIGINAL complete term j=1 := sum(-3, -1)
After
Sequence prefix ORIGINAL complete term j=1 = -4
Conditions: none
Use ORIGINAL operands exactly;mul/sub/div have EXPLICITLY TWO operands so the old binary primitive cannot ignore a third.Keep RAW SAFE bounds separate from unbounded derived BigInts;do not approximate to force answers.
Take EXACTLY L terms in index order from a0 through a_(L−1),NOT through aL.L=0 displays[].The GIVEN formula determines these terms;the prefix alone need not determine an unknown rule.
S007 · premise_and_result_audit — Reverse-audit THIS question’s ORIGINAL data,types,roles,complete premises and field order.Do not invert implication or turn finite-table checks into infinite-domain/formal proof.Original Q/English/MKO/AST/status remain unchanged.
S006 · premise_and_result_audit — Recompute Sequence prefix ORIGINAL complete term j=1 with exact rational arithmetic, not rounded decimals.
S005 · premise_and_result_audit — Recompute Sequence prefix ORIGINAL index times step j=1 with exact rational arithmetic, not rounded decimals.
S004 · premise_and_result_audit — Recompute Sequence prefix ORIGINAL complete term j=0 with exact rational arithmetic, not rounded decimals.
S003 · premise_and_result_audit — Recompute Sequence prefix ORIGINAL index times step j=0 with exact rational arithmetic, not rounded decimals.
S002 · premise_and_result_audit — Reverse-audit THIS question’s ORIGINAL data,types,roles,complete premises and field order.Do not invert implication or turn finite-table checks into infinite-domain/formal proof.Original Q/English/MKO/AST/status remain unchanged.
S001 · premise_and_result_audit — Reverse-audit THIS question’s ORIGINAL data,types,roles,complete premises and field order.Do not invert implication or turn finite-table checks into infinite-domain/formal proof.Original Q/English/MKO/AST/status remain unchanged.
Result
[-3, -4]
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.
This question review and source binding
Review date: 2026-10-26
Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.