The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A367361 Comma transform of powers of 2. 3
 12, 24, 48, 81, 63, 26, 41, 82, 65, 21, 42, 84, 68, 21, 43, 86, 61, 22, 45, 81, 62, 24, 48, 81, 63, 26, 41, 82, 65, 21, 42, 84, 68, 21, 43, 86, 61, 22, 45, 81, 62, 24, 48, 81, 63, 27, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS See A367360 for further information. LINKS Michael De Vlieger, Table of n, a(n) for n = 0..10000 FORMULA a(n) = 10 * A000689(n) + A008952(n+1). - Alois P. Heinz, Nov 22 2023 MATHEMATICA FromDigits /@ Partition[Rest@ Flatten[{First[#], Last[#]} & /@ IntegerDigits[2^Range[0, 120]]], 2, 2] (* Michael De Vlieger, Nov 22 2023 *) PROG (Python) from itertools import count, islice, pairwise def S(): yield from (str(2**i) for i in count(0)) def agen(): yield from (int(t[-1]+u[0]) for t, u in pairwise(S())) print(list(islice(agen(), 80))) # Michael S. Branicky, Nov 22 2023 (Python) def A367361(n): return (60, 20, 40, 80)[n&3]+int(str(1<

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.

Last modified May 28 04:02 EDT 2024. Contains 372900 sequences. (Running on oeis4.)