Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067972
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
2
1, 125, 15625, 1157625, 311665752, 19356769125, 291566137591, 5131167956992, 110979523759616, 1295599371716096, 16597961902739125, 191569168079975232, 1081935177662959192, 10103177625989916259, 110151807092929695367 (list; graph; listen)
OFFSET

0,2

FORMULA

A067971^3

CROSSREFS

Cf. A067971.

Sequence in context: A102076 A030695 A121005 this_sequence A094197 A067491 A036532

Adjacent sequences: A067969 A067970 A067971 this_sequence A067973 A067974 A067975

KEYWORD

base,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research