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.

A222251 In the number n, replace all (decimal) digits '6' with '9' and vice versa.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 9, 7, 8, 6, 10, 11, 12, 13, 14, 15, 19, 17, 18, 16, 20, 21, 22, 23, 24, 25, 29, 27, 28, 26, 30, 31, 32, 33, 34, 35, 39, 37, 38, 36, 40, 41, 42, 43, 44, 45, 49, 47, 48, 46, 50, 51, 52, 53, 54, 55, 59, 57, 58, 56, 90, 91, 92, 93, 94, 95, 99, 97, 98, 96, 70, 71, 72, 73, 74, 75
Offset: 0

Views

Author

M. F. Hasler, Feb 13 2013

Keywords

Comments

The map which is applied to primes in A171055.

Crossrefs

Programs

  • Mathematica
    a[n_]:= IntegerDigits[n]/.{6->9, 9->6} // FromDigits; Table[a[n], {n, 0, 80}] (* Vincenzo Librandi, Jul 31 2013 *)
  • PARI
    A222251(n,d=[0, 1, 2, 3, 4, 5, 9, 7, 8, 6])=sum(i=1,#n=digits(n),d[n[i]+1]*10^(#n-i),!n*d[1]) \\ N.B.: digits(0)=[] in PARI (v.2.6)
    
  • Python
    def flp69(s): return s.replace("6", "-").replace("9", "6").replace("-", "9")
    def aupto(lim): return [int(flp69(s)) for s in map(str, range(lim+1))]
    print(aupto(75)) # Michael S. Branicky, Sep 07 2021