OFFSET
0,2
COMMENTS
See A367360 for further information.
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..10000
MAPLE
F:= combinat[fibonacci]:
a:= n-> parse(cat(""||(F(n))[-1], ""||(F(n+1))[1])):
seq(a(n), n=0..92);
MATHEMATICA
With[{nmax=100}, Map[10Mod[#[[1]], 10]+IntegerDigits[#[[2]]][[1]]&, Partition[Fibonacci[Range[0, nmax+1]], 2, 1]]] (* Paolo Xausa, Nov 24 2023 *)
PROG
(Python)
from sympy import fibonacci
from itertools import islice, pairwise, count
def S(): yield from (fibonacci(i) for i in count(0))
def C(g): # generator of comma transform of sequence passed as a generator
yield from (10*(t%10) + int(str(u)[0]) for t, u in pairwise(g))
def agen(): return C(S())
print(list(islice(agen(), 67))) # Michael S. Branicky, Jan 05 2024
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Alois P. Heinz, Nov 22 2023
STATUS
approved