Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067971
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
4
1, 5, 25, 105, 678, 2685, 6631, 17248, 48056, 109016, 255085, 576468, 1026598, 2161819, 4793623, 10107506, 21624889, 46584891, 100042239, 215671305, 464309988, 1000305876 (list; graph; listen)
OFFSET

0,2

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: A098111 A083877 A146882 this_sequence A111641 A074419 A147161

Adjacent sequences: A067968 A067969 A067970 this_sequence A067972 A067973 A067974

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research