Числа Трибоначчи

limit = int(input())
old_fib = 1
current_fib = 1
while old_fib <= limit:
    print(old_fib)
    new_fib = old_fib + current_fib
    old_fib = current_fib
    current_fib = new_fib

limit = int(input())
a = [1,1,1]
for _ in range (limit-3):
    a.append(sum(a[-3:]))
print(*a)

# По умолчанию генерирует последовательность https://oeis.org/A000073
def createTribonacci(limit, init=(2, 0, -1, 1)):
    a, b, c, d = init
    for _ in range(limit):
        a, b, c, d = b, c, d, 2*d - a
        yield d 
 
limit = int(input())
 
gen = createTribonacci(limit, init=(-3, 1, 1, -1))
print(*gen)

cout = 0
prev1 = 1
prev2 = 1
prev3 = 1
now = prev1 + prev2 + prev3
a = int(input())
if a == 1:
    print(prev1)
    cout += 1
elif a == 2:
    print(prev1)
    cout += 1
    print(prev2)
    cout += 1
else:
    print(prev1)
    cout += 1
    print(prev2)
    cout += 1
    print(prev3)
    cout += 1
while True:
    if a == 1:
        break
    elif a == 2:
        break
    elif a == 3:
        break
    print(now)
    cout += 1
    if cout >= a:
        break
    prev1 = prev2
    prev2 = prev3
    prev3 = now
    now = prev1 + prev2 + prev3

6
1 1 1 3 5 9
>>> 
================ RESTART: C:\Users\python\test.py ================
8
1 1 1 3 5 9 17 31
>>>

def tribonacci(param):
    f1,f2,f3 = 0,0,1
    for i in range(param):
        f1,f2,f3 = f2,f3,f1+f2+f3
        yield f1
 
f = tribonacci(10)
for i in range(10):
    print(next(f))

fst = [1, 1, 1]
a = int(input())
for i in range(a):
    answ = fst[0] + fst[1] + fst[2]
    print(fst[0])
    fst[0] = fst[1]
    fst[1] = fst[2]
    fst[2] = answ

result = [1, 1, 1]
 
limit = 10
 
while 1:
    if len(result) >= limit:
        break
    new = sum(result[-3:])
    result.append(new)
print(result)