login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A367361 Comma transform of powers of 2. 3

%I #20 Dec 22 2023 15:32:09

%S 12,24,48,81,63,26,41,82,65,21,42,84,68,21,43,86,61,22,45,81,62,24,48,

%T 81,63,26,41,82,65,21,42,84,68,21,43,86,61,22,45,81,62,24,48,81,63,27,

%U 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 Comma transform of powers of 2.

%C See A367360 for further information.

%H Michael De Vlieger, <a href="/A367361/b367361.txt">Table of n, a(n) for n = 0..10000</a>

%F a(n) = 10 * A000689(n) + A008952(n+1). - _Alois P. Heinz_, Nov 22 2023

%t FromDigits /@ Partition[Rest@ Flatten[{First[#], Last[#]} & /@ IntegerDigits[2^Range[0, 120]]], 2, 2] (* _Michael De Vlieger_, Nov 22 2023 *)

%o (Python)

%o from itertools import count, islice, pairwise

%o def S(): yield from (str(2**i) for i in count(0))

%o def agen(): yield from (int(t[-1]+u[0]) for t, u in pairwise(S()))

%o print(list(islice(agen(), 80))) # _Michael S. Branicky_, Nov 22 2023

%o (Python)

%o 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 Cf. A000079, A000689, A008952, A166499, A367360.

%K nonn,base

%O 0,1

%A _N. J. A. Sloane_, Nov 22 2023

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 12 02:35 EDT 2024. Contains 375842 sequences. (Running on oeis4.)