A235810 -id:A235810 - cp's OEIS frontend

A235811 Numbers n such that n^3 has one or more occurrences of exactly nine different digits.

1018, 1028, 1112, 1452, 1475, 1484, 1531, 1706, 1721, 1733, 1818, 1844, 1895, 1903, 2008, 2033, 2208, 2214, 2217, 2223, 2257, 2274, 2277, 2327, 2329, 2336, 2354, 2394, 2403, 2524, 2525, 2589, 2647, 2686, 2691, 2694, 2727, 2733, 2784, 2842, 2866, 2884, 2890

Offset: 1

Colin Barker, Jan 19 2014

			1018 is in the sequence because 1018^3 = 1054977832, which contains exactly nine different digits.

Colin Barker, Table of n, a(n) for n = 1..1000

Cf. A030292, A155146, A155147, A235807-A235810, A119735.

Select[Range[3000],Count[DigitCount[#^3],0]==1&] (* Harvey P. Dale, Dec 17 2021 *)

s=[]; for(n=1, 3000, if(#vecsort(eval(Vec(Str(n^3))),,8)==9, s=concat(s, n))); s

A235811_list, m = [], [6, -6, 1, 0]
for n in range(1,10**4+1):
    for i in range(3):
        m[i+1] += m[i]
    if len(set(str(m[-1]))) == 9:
        A235811_list.append(n) # Chai Wah Wu, Nov 05 2014

A235809 Numbers k such that k^3 has one or more occurrences of exactly seven different digits.

Original entry on oeis.org

135, 145, 203, 221, 223, 225, 227, 233, 243, 244, 245, 247, 249, 254, 257, 265, 272, 273, 275, 276, 299, 313, 327, 329, 334, 338, 341, 345, 347, 352, 365, 366, 368, 382, 384, 388, 393, 395, 398, 403, 405, 409, 411, 412, 434, 439, 447, 452, 455, 473, 486, 493

Offset: 1

Colin Barker, Jan 19 2014

			135 is in the sequence because 135^3 = 2460375, which contains exactly seven different digits.

Colin Barker, Table of n, a(n) for n = 1..1000

Cf. A030292, A155146, A155147, A235807, A235808, A235810, A235811, A119735.

[n: n in [0..1200] | #Set(Intseq(n^3)) eq 7]; // Vincenzo Librandi, Nov 07 2014

Select[Range[500], Length[Union[IntegerDigits[#^3]]]==7&] (* Vincenzo Librandi, Nov 07 2014 *)

s=[]; for(n=1, 600, if(#vecsort(eval(Vec(Str(n^3))),,8)==7, s=concat(s, n))); s

for(n=0,10^3,if(#Set(digits(n^3))==7,print1(n,", "))); \\ Joerg Arndt, Nov 10 2014

from itertools import count, islice
def A235809gen(): return filter(lambda n:len(set(str(n**3))) == 7,count(0))
A235809_list = list(islice(A235809gen(),26)) # Chai Wah Wu, Dec 23 2021

cp's OEIS Frontend

A235811 Numbers n such that n^3 has one or more occurrences of exactly nine different digits.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

A235809 Numbers k such that k^3 has one or more occurrences of exactly seven different digits.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Python