cp's OEIS Frontend

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.

Showing 1-2 of 2 results.

A341708 Negative terms in A341707, in order of appearance (and negated).

Original entry on oeis.org

38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182
Offset: 1

Views

Author

N. J. A. Sloane, Feb 18 2021

Keywords

Crossrefs

Cf. A341707.

Programs

Extensions

More terms from Jinyuan Wang, Feb 18 2021

A341709 Write n as a sum of powers of 2 then replace each power of 2 in the sum by its decimal reversal A004094(n).

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 46, 47, 48, 49, 50, 51, 52, 53, 54
Offset: 0

Views

Author

N. J. A. Sloane, Feb 18 2021

Keywords

Comments

Suggest by Eric Angelini's yranib sequence A341707.

Examples

			17 = 16+1 becomes 1+61 = 62 = a(17).
		

Crossrefs

Programs

  • Maple
    revbin:= n-> (s-> parse(cat(s[-i]$i=1..length(s))))(""||(2^n)): # A004094
    f:=proc(n)  local t1,i;
      t1:=convert(n,base,2);
      add(t1[i]*revbin(i-1),i=1..nops(t1));
    end:
    seq(f(n), n=0..72);
  • Python
    def A341709(n):
        m, c = 1, 0
        while n > 0:
            n, b = divmod(n,2)
            c += b*int(str(m)[::-1])
            m *= 2
        return c # Chai Wah Wu, Feb 18 2021
Showing 1-2 of 2 results.