A109135 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A109135

Least number whose n-th power is exclusionary (or 0 if no such n exists). An exclusionary n-th power m^n is one made up of digits not appearing in m, which itself consists of distinct digits.

0, 2, 2, 2, 0, 2, 3, 3, 0, 3, 3, 2, 0, 2, 0, 2, 0, 0, 3, 2, 0, 2, 2, 7, 0, 2, 3, 3, 0, 0, 0, 0, 0, 2, 2, 2, 0, 0, 2, 3, 0, 2, 0, 0, 0, 2, 0, 0, 0, 3, 0, 0, 0, 2, 3, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,2

COMMENTS

a(n)=0 for n=1(mod 4)=A016813.

a(4k+1) = 0. All other zeros are unproved and have been checked up to m = 1000. - David Wasserman, May 27 2008

REFERENCES

H. Ibstedt, Solution to Problem 2623, "Exclusionary Powers", pp. 346-9 Journal of Recreational Mathematics, Vol. 32 No.4 2003-4 Baywood NY.

LINKS

Table of n, a(n) for n=2..106.

CROSSREFS

Cf. A113951.