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.

A281678 Numbers k that have no digits in common with k^7.

Original entry on oeis.org

3, 7, 8, 33, 43, 77, 93, 272, 332, 662, 7757, 31333
Offset: 1

Views

Author

Robert Israel, Jan 26 2017

Keywords

Comments

All terms have last digit 2, 3, 7 or 8.
Sequence is likely to be finite. If it exists, a(13) > 10^7.
In this sequence, the only terms with no repeated digits are 3, 7, 8, 43, 93. - Altug Alkan, Jan 26 2017
If it exists, a(13) > 10^17. - David Radcliffe, May 26 2025

Examples

			43 is a term because 43^7 = 271818611107 has no digit 4 or 3.
		

Crossrefs

Cf. A001015. Contains A253576.
Cf. A281148.

Programs

  • Maple
    select(t -> convert(convert(t,base,10),set) intersect convert(convert(t^7,base,10),set) = {},
    {seq(seq(10*i+j,j=[2,3,7,8]),i=0..10^4});
  • Mathematica
    Select[Range[40000], Intersection[IntegerDigits[#], IntegerDigits[ #^7]] == {}&] (* Vincenzo Librandi, Jan 27 2017 *)
  • PARI
    isok(n) = #setintersect(Set(digits(n)), Set(digits(n^7))) == 0; \\ Michel Marcus, Jan 26 2017

A253575 Primes p such that digits of p do not appear in p^6.

Original entry on oeis.org

2, 3, 13, 44449
Offset: 1

Views

Author

Vincenzo Librandi, Jan 04 2015

Keywords

Comments

a(5) > 10^9. - Chai Wah Wu, Jan 05 2015

Examples

			2 and 2^6 = 64 have no digits in common, hence 2 is in the sequence.
		

Crossrefs

Primes in A281148.
Cf. similar sequences listed in A253574.

Programs

  • Maple
    select(t -> isprime(t) and convert(convert(t,base,10),set) intersect convert(convert(t^6,base,10),set) = {},
    {2, seq(i,i=3..10^5,2)}); # Robert Israel, May 25 2025
  • Mathematica
    Select[Prime[Range[1000000]], Intersection[IntegerDigits[#], IntegerDigits[#^6]]=={} &]
  • Python
    from sympy import isprime
    A253575_list = [n for n in range(1,10**6) if set(str(n)) & set(str(n**6)) == set() and isprime(n)]
    # Chai Wah Wu, Jan 05 2015
Showing 1-2 of 2 results.