A383321 a(n) = Fibonacci(A383320(n)).

0, 1, 5, 433494437, 2, 3, 34, 701408733, 24157817, 1, 3524578, 74938658661142424746936931013871484819301255773627024651689719443505027723135990224027850523592585, 81055900096023504197206408605, 21, 13

Offset: 1

Author

Dominic McCarty, Apr 23 2025

Keywords

• nonn
• base

Links

• Dominic McCarty, Table of n, a(n) for n = 1..34

Crossrefs

Cf. A383320, A038546, A383318, A383322, A302656.

Programs

Python

from sympy import fibonacci
from itertools import count
a, b, sa, sb = [0,1,5,43], [0,1,5,433494437], "01543", "015433494437"
for _ in range(10):
    a.append(next(n for k in count(1) if not (n := int(sb[len(sa):len(sa)+k])) in a and not (len(sb) > len(sa) + k and sb[len(sa) + k] == "0")))
    b.append(fibonacci(a[-1]))
    sa += str(a[-1]); sb += str(b[-1])
print(b)