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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A067971 a(n+1) is the smallest number > a(n) such that the digits of a(n)^3 are all (with multiplicity) properly contained in the digits of a(n+1)^3, with a(0)=1. 3
 1, 5, 25, 105, 678, 2685, 6631, 17248, 48056, 109016, 255085, 576468, 1026598, 2161819, 4793623, 10107506, 21624889, 46584891, 100042239, 215671305, 464309988, 1000305876 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS EXAMPLE 5^3 = 125 and 25 is the next smallest number whose cube (in this case 15625) properly contains the digits 1,2,5. CROSSREFS Cf. A065297, A065298, A067972. Sequence in context: A146882 A218264 A264018 * A266424 A224129 A111641 Adjacent sequences:  A067968 A067969 A067970 * A067972 A067973 A067974 KEYWORD base,nonn AUTHOR Marc Paulhus, Feb 05 2002 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.

Last modified May 14 13:50 EDT 2021. Contains 343884 sequences. (Running on oeis4.)