This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A367556 #19 Jan 05 2024 17:48:28 %S A367556 1,11,12,23,35,58,81,32,13,45,58,91,42,33,76,9,71,72,44,16,51,61,12, %T A367556 74,87,51,31,83,15,98,1,92,93,85,79,51,22,73,96,61,51,12,64,77,31,1, %U A367556 32,34,67,91,52,43,95,38,21,52,73,25,99,11,2,14,16,21,31,52,84 %N A367556 Comma transform of the Fibonacci numbers. %C A367556 See A367360 for further information. %H A367556 Alois P. Heinz, <a href="/A367556/b367556.txt">Table of n, a(n) for n = 0..10000</a> %F A367556 a(n) = 10 * A003893(n) + A008963(n+1). %p A367556 F:= combinat[fibonacci]: %p A367556 a:= n-> parse(cat(""||(F(n))[-1], ""||(F(n+1))[1])): %p A367556 seq(a(n), n=0..92); %t A367556 With[{nmax=100},Map[10Mod[#[[1]],10]+IntegerDigits[#[[2]]][[1]]&,Partition[Fibonacci[Range[0,nmax+1]],2,1]]] (* _Paolo Xausa_, Nov 24 2023 *) %o A367556 (Python) %o A367556 from sympy import fibonacci %o A367556 from itertools import islice, pairwise, count %o A367556 def S(): yield from (fibonacci(i) for i in count(0)) %o A367556 def C(g): # generator of comma transform of sequence passed as a generator %o A367556 yield from (10*(t%10) + int(str(u)[0]) for t, u in pairwise(g)) %o A367556 def agen(): return C(S()) %o A367556 print(list(islice(agen(), 67))) # _Michael S. Branicky_, Jan 05 2024 %Y A367556 Cf. A000045, A003893, A008963, A138844, A367360. %K A367556 nonn,base %O A367556 0,2 %A A367556 _Alois P. Heinz_, Nov 22 2023