from machine import Pin
import time
# LIsta de pines GP2 a GP11
gpio_pins = [11,10,9,8,7,6,5,4,3,2]

# Definir los pines GPIO como salida
for i in gpio_pins:
    Pin(i,Pin.OUT)
num = 0

def fibonacci(n):
    a, b = 0, 1
    out = []
    for _ in range(n):
        out.append(a)
        cadena=salp(a)
        print("numero=",a,"="+cadena) 
        a, b = b, a + b
        time.sleep_ms(50)
    return out

def lucas(n):
    a, b = 2, 1
    out = []
    for _ in range(n):
        out.append(a)
        cadena=salp(a)
        print("numero=",a,"="+cadena) 
        a, b = b, a + b
    return out

def tribonacci(n):
    # T(0)=0, T(1)=0, T(2)=1; T(n)=T(n-1)+T(n-2)+T(n-3)
    a, b, c = 0, 0, 1
    out = []
    for _ in range(n):
        out.append(a)
        cadena=salp(a)
        print("numero=",a,"="+cadena) 
        a, b, c = b, c, a + b + c
    return out

def tetranacci(n):
    # 0,0,0,1 y luego suma de los 4 previos
    a, b, c, d = 0, 0, 0, 1
    out = []
    for _ in range(n):
        out.append(a)
        cadena=salp(a)
        print("numero=",a,"="+cadena) 
        a, b, c, d = b, c, d, a + b + c + d
    return out

def padovan(n):
    # P(0)=P(1)=P(2)=1; P(n)=P(n-2)+P(n-3)
    if n <= 0: return []
    if n == 1: return [1]
    if n == 2: return [1, 1]
    P = [1, 1, 1]
    for k in range(3, n):
        P.append(P[k-2] + P[k-3])
    return P

def perrin(n):
    # R(0)=3, R(1)=0, R(2)=2; R(n)=R(n-2)+R(n-3)
    if n <= 0: return []
    if n == 1: return [3]
    if n == 2: return [3, 0]
    R = [3, 0, 2]
    for k in range(3, n):
        cadena=salp(R[k-2] + R[k-3])
        print("numero=",R[k-2] + R[k-3],"="+cadena) 
        R.append(R[k-2] + R[k-3])
    return R

def pell(n):
    # P(0)=0, P(1)=1; P(n)=2P(n-1)+P(n-2)
    a, b = 0, 1
    out = []
    for _ in range(n):
        out.append(a)
        cadena=salp(a)
        print("numero=",a,"="+cadena) 
        a, b = b, 2*b + a
    return out

def jacobsthal(n):
    # J(0)=0, J(1)=1; J(n)=J(n-1)+2J(n-2)
    a, b = 0, 1
    out = []
    for _ in range(n):
        out.append(a)
        cadena=salp(a)
        print("numero=",a,"="+cadena) 
        a, b = b, b + 2*a
    return out

def catalan(n):
    # C0=1; C_{k+1} = C_k * 2*(2k+1)/(k+2)  (entero exacto)
    out = []
    c = 1
    for k in range(n):
        out.append(c)
        cadena=salp(c)
        print("numero=",c,"="+cadena) 
        c = c * 2 * (2*k + 1) // (k + 2) if k + 1 < n else c
    return out

def mersenne(n):
    # M(n) = 2^n - 1
    return [(1 << k) - 1 for k in range(n)]  # rápido en uPython

def salp(datos):
    ii=512
    cbin =""
    for pins in gpio_pins:
        if ((datos & ii) !=0):
            Pin(pins,Pin.OUT).value(1)
            cbin=cbin+"1"
        else:
            Pin(pins,Pin.OUT).value(0)
            cbin=cbin+"0"
        ii=ii>>1
    return cbin

while True:
    N=25
    fibonacci(N)
    lucas(N)
    tribonacci(N)
    tetranacci(N)
    padovan(N)
    perrin(N)
    pell(N)
    jacobsthal(N)
    catalan(N)
    mersenne(N)