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.

A239058 Numbers whose divisors all appear as a substring in their decimal expansion.

Original entry on oeis.org

1, 11, 13, 17, 19, 31, 41, 61, 71, 101, 103, 107, 109, 113, 125, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 241, 251, 271, 281, 311, 313, 317, 331, 401, 419, 421, 431, 461, 491, 521, 541, 571, 601, 613, 617, 619, 631, 641, 661, 691, 701, 719, 751, 761, 811, 821, 881, 911, 919, 941, 971
Offset: 1

Views

Author

M. F. Hasler, Mar 09 2014

Keywords

Comments

A subsequence of A092911 (all divisors can be formed using the digits of the number) which is a subsequence of A011531 (numbers having the digit 1).
Are 1 and 125 the only nonprime terms in this sequence?
No: 17692313, 4482669527413081, 21465097175420089, and 567533481816008761 are members. - Charles R Greathouse IV, Mar 09 2014
See A239060 for the nonprime terms of this sequence, which include in particular the squares of terms of A115738 (unless such a square would not have a digit 1).

Examples

			All primes having the digit 1 (A208270) are in this sequence, because {1, p} are the only divisors of a prime p.
The divisors of 125 are {1, 5, 25, 125}; it can be seen that all of them occur as a substring in 125, therefore 125 is in this sequence.
		

Crossrefs

Programs

  • PARI
    is(n,d=vecextract(divisors(n),"^-1"))={ setminus(select(x->x<10,d),Set(digits(n)))&&return;!for(L=2,#Str(d[#d]),setminus(select(x->x
    <10^L&&x>=10^(L-1),d),Set(concat(vector(L,o,digits(n\10^(L-o),10^L)))))&&return)}
    
  • PARI
    overlap(long,short)=my(D=10^#digits(short)); while(long>=short, if(long%D==short,return(1));long\=10); 0
    is(n)=my(d=divisors(n)); forstep(i=#d-1,1,-1, if(!overlap(n,d[i]), return(0))); 1 \\ Charles R Greathouse IV, Mar 09 2014

A318965 a(n) is the smallest number containing all its n prime factors in its decimal representation.

Original entry on oeis.org

2, 135, 735, 21372, 271362, 4773132, 113678565, 11317129824, 131175822960, 7113719552940, 255360234137190, 12411792985131540
Offset: 1

Views

Author

Giovanni Resta, Sep 06 2018

Keywords

Examples

			a(2) = 135 = 3^3 * 5,
a(3) = 735 = 3 * 5 * 7^2,
a(4) = 21372 = 2^2 * 3 * 13 * 137,
a(5) = 271362 = 2 * 3 * 7^2 * 13 * 71,
a(6) = 4773132 = 2^2 * 3^2 * 7 * 13 * 31 * 47.
a(7) = 113678565 = 3 * 5 * 7 * 11 * 13 * 67 * 113.
		

Crossrefs

Programs

  • Mathematica
    a[n_] := Block[{k=1, s, f}, While[True, k++; If[Length[f = FactorInteger[k]] == n, s = ToString@k; If[AllTrue[First /@ f, StringPosition[s, ToString@ #] != {} &], Break[]]]]; k]; Array[a, 5]
Showing 1-2 of 2 results.