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.

A204095 Numbers whose base 10 digits are a subset of {0, 8}.

Original entry on oeis.org

0, 8, 80, 88, 800, 808, 880, 888, 8000, 8008, 8080, 8088, 8800, 8808, 8880, 8888, 80000, 80008, 80080, 80088, 80800, 80808, 80880, 80888, 88000, 88008, 88080, 88088, 88800, 88808, 88880, 88888, 800000, 800008, 800080, 800088, 800800, 800808, 800880, 800888
Offset: 0

Views

Author

Reinhard Zumkeller, Jan 10 2012

Keywords

Crossrefs

Programs

  • Haskell
    a204095 n = a204095_list !! n
    a204095_list = map (* 8) a007088_list
    
  • Maple
    f:= proc(n) local L; L:= convert(n,base,2); add(8*L[i]*10^(i-1),i=1..nops(L)) end proc:
    seq(f(n),n=0..100); # Robert Israel, Jul 28 2014
  • Mathematica
    Table[8 FromDigits[IntegerDigits[n, 2]], {n, 0, 39}] (* Alonso del Arte, Jan 10 2012 *)
  • PARI
    a(n)=8*subst(Pol(binary(n)), x, 10);
    for(n=0, 20, print1(a(n), ", ")) \\ Felix Fröhlich, Jul 26 2014

Formula

a(n) = 8 * A007088(n).

Extensions

Definition corrected by M. F. Hasler, Feb 08 2020

A096687 Least k such that decimal representation of k*n contains only digits 0 and 8.

Original entry on oeis.org

8, 4, 296, 2, 16, 148, 1144, 1, 98765432, 8, 8, 74, 616, 572, 592, 5, 5224, 49382716, 4632, 4, 3848, 4, 38296, 37, 32, 308, 326255144, 286, 303752, 296, 28648, 25, 26936, 2612, 2288, 24691358, 24, 2316, 2072, 2, 2168, 1924, 204856, 2, 197530864, 19148
Offset: 1

Views

Author

Ray Chandler, Jul 12 2004

Keywords

Crossrefs

Programs

  • Python
    def A096687(n):
        if n > 0:
            for i in range(1, 2**n):
                q, r = divmod(8*int(bin(i)[2:]), n)
                if not r:
                    return q
        return 1 # Chai Wah Wu, Jan 02 2015

Formula

a(n) = A078247(n)/n.
Showing 1-2 of 2 results.