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 A367361 #20 Dec 22 2023 15:32:09
%S A367361 12,24,48,81,63,26,41,82,65,21,42,84,68,21,43,86,61,22,45,81,62,24,48,
%T A367361 81,63,26,41,82,65,21,42,84,68,21,43,86,61,22,45,81,62,24,48,81,63,27,
%U A367361 41,82,65,21,42,84,69,21,43,87,61,22,45,81,62,24,49,81,63,27,41,82,65,21,42,84,69,21,43,87,61,23,46,81
%N A367361 Comma transform of powers of 2.
%C A367361 See A367360 for further information.
%H A367361 Michael De Vlieger, <a href="/A367361/b367361.txt">Table of n, a(n) for n = 0..10000</a>
%F A367361 a(n) = 10 * A000689(n) + A008952(n+1). - _Alois P. Heinz_, Nov 22 2023
%t A367361 FromDigits /@ Partition[Rest@ Flatten[{First[#], Last[#]} & /@ IntegerDigits[2^Range[0, 120]]], 2, 2] (* _Michael De Vlieger_, Nov 22 2023 *)
%o A367361 (Python)
%o A367361 from itertools import count, islice, pairwise
%o A367361 def S(): yield from (str(2**i) for i in count(0))
%o A367361 def agen(): yield from (int(t[-1]+u[0]) for t, u in pairwise(S()))
%o A367361 print(list(islice(agen(), 80))) # _Michael S. Branicky_, Nov 22 2023
%o A367361 (Python)
%o A367361 def A367361(n): return (60,20,40,80)[n&3]+int(str(1<<n+1)[0]) if n else 12 # _Chai Wah Wu_, Dec 22 2023
%Y A367361 Cf. A000079, A000689, A008952, A166499, A367360.
%K A367361 nonn,base
%O A367361 0,1
%A A367361 _N. J. A. Sloane_, Nov 22 2023