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.

A048382 Primes resulting from procedure described in A048381.

Original entry on oeis.org

2, 3, 5, 7, 11, 13, 17, 19, 23, 23, 211, 223, 31, 37, 311, 313, 317, 53, 523, 71, 73, 719, 113, 1117, 1123, 131, 137, 1319, 173, 1723, 191, 193, 197, 1913, 233, 2311, 211, 2111, 2113, 223, 227, 2213, 233, 2311, 251, 257, 271, 277, 2711, 2713, 2719, 2111
Offset: 1

Views

Author

Patrick De Geest, Mar 15 1999

Keywords

Comments

Primes in A048380 in order of their occurrence. - Andrew Howroyd, Aug 15 2024

Crossrefs

Formula

a(n) = A048380(A048381(n)). - Andrew Howroyd, Aug 15 2024

Extensions

Offset corrected by Andrew Howroyd, Aug 15 2024

A048380 Digits d in decimal expansion of n replaced with d-th prime (replacing each 0 digit with a 1).

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 21, 22, 23, 25, 27, 211, 213, 217, 219, 223, 31, 32, 33, 35, 37, 311, 313, 317, 319, 323, 51, 52, 53, 55, 57, 511, 513, 517, 519, 523, 71, 72, 73, 75, 77, 711, 713, 717, 719, 723, 111, 112, 113, 115, 117, 1111, 1113, 1117, 1119
Offset: 0

Views

Author

Patrick De Geest, Mar 15 1999

Keywords

Crossrefs

Programs

  • Maple
    a:= n-> (l-> parse(cat(seq(`if`(l[-i]=0, 1, ithprime(l[-i])),
                 i=1..nops(l)))))(convert(n, base, 10)):
    seq(a(n), n=0..80);  # Alois P. Heinz, Nov 07 2019
  • Mathematica
    Table[FromDigits[Flatten[IntegerDigits/@(If[#==0,1,Prime[#]]&/@ IntegerDigits[ n])]], {n,0,60}] (* Harvey P. Dale, Sep 02 2018 *)

Extensions

Name clarified by Jon E. Schoenfield, Oct 13 2019
Showing 1-2 of 2 results.