login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067972 a(n+1) is the smallest cube > a(n) such that the digits of a(n) are all (with multiplicity) properly contained in the digits of a(n+1), with a(0)=1. 1
1, 125, 15625, 1157625, 311665752, 19356769125, 291566137591, 5131167956992, 110979523759616, 1295599371716096, 16597961902739125, 191569168079975232, 1081935177662959192, 10103177625989916259, 110151807092929695367 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

FORMULA

A067971^3

CROSSREFS

Cf. A067971.

Sequence in context: A102076 A030695 A121005 * A094197 A067491 A036532

Adjacent sequences:  A067969 A067970 A067971 * A067973 A067974 A067975

KEYWORD

base,nonn

AUTHOR

Marc Paulhus (paulhus(AT)wanadoo.nl), Feb 05 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 04:38 EST 2012. Contains 205978 sequences.