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.

A337239 Numbers having at least one 7 in their representation in base 8.

Original entry on oeis.org

7, 15, 23, 31, 39, 47, 55, 56, 57, 58, 59, 60, 61, 62, 63, 71, 79, 87, 95, 103, 111, 119, 120, 121, 122, 123, 124, 125, 126, 127, 135, 143, 151, 159, 167, 175, 183, 184, 185, 186, 187, 188, 189, 190, 191, 199, 207, 215, 223, 231, 239, 247, 248, 249, 250, 251, 252, 253, 254, 255
Offset: 1

Views

Author

François Marques, Sep 20 2020

Keywords

Comments

Complementary sequence to A037474.

Examples

			54 is not in the sequence since it is 66_8 in base 8, but 55 is in the sequence since it is 67_8 in base 8.
		

Crossrefs

Cf. Numbers with at least one digit b-1 in base b : A074940 (b=3), A337250 (b=4), A337572 (b=5), A333656 (b=6), A337141 (b=7), this sequence (b=8), A338090 (b=9), A011539 (b=10), A095778 (b=11).
Cf. Numbers with no digit b-1 in base b: A005836 (b=3), A023717 (b=4), A020654 (b=5), A037465 (b=6), A020657 (b=7), A037474 (b=8), A037477 (b=9), A007095 (b=10), A171397 (b=11).

Programs

  • Maple
    seq(`if`(numboccur(7, convert(n, base, 8))>0, n, NULL), n=0..100);
  • Mathematica
    Select[ Range[ 0, 100 ], (Count[ IntegerDigits[ #, 8 ], 7 ]>0)& ]
  • PARI
    isok(m) = #select(x->(x==7), digits(m, 8)) >= 1;
    
  • Python
    def A337239(n):
        def f(x):
            s = oct(x)[2:]
            l = s.find('7')
            if l >= 0:
                s = s[:l]+'6'*(len(s)-l)
            return n+int(s,7)
        m, k = n, f(n)
        while m != k: m, k = k, f(k)
        return m # Chai Wah Wu, Dec 04 2024