login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119735 Numbers n such that every digit occurs at least once in n^3. 11
2326, 2535, 2795, 3123, 3506, 3909, 4602, 4782, 5027, 5048, 5196, 5362, 5394, 5402, 5437, 6215, 6221, 6517, 6687, 6789, 6802, 6993, 7061, 7202, 7219, 7616, 7638, 8124, 8244, 8248, 8288, 8384, 8402, 8443, 8496, 8499, 8817, 9006, 9048, 9142, 9374, 9476 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

T. D. Noe, Table of n, a(n) for n = 1..10000

MATHEMATICA

Select[Range[10000], Union[IntegerDigits[#^3]]==Range[0, 9]&] (* Harvey P. Dale, Apr 11 2014 *)

PROG

(PARI) isok(n) = length(Set(digits(n^3))) == 10; \\ Michel Marcus, Aug 28 2013

(Python)

A119735_list, m = [], [6, -6, 1, 0]

for n in range(1, 10**6+1):

....for i in range(3):

........m[i+1] += m[i]

....if len(set(str(m[-1]))) == 10:

........A119735_list.append(n) # Chai Wah Wu, Nov 05 2014

CROSSREFS

Cf. A030292.

Sequence in context: A137733 A205636 A250998 * A115933 A232107 A186058

Adjacent sequences:  A119732 A119733 A119734 * A119736 A119737 A119738

KEYWORD

base,nonn

AUTHOR

Dmitry Kamenetsky, Jun 15 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 29 22:32 EDT 2021. Contains 346346 sequences. (Running on oeis4.)