Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A061435
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A061435 a(n) = largest n-digit cube. +0
3
8, 64, 729, 9261, 97336, 970299, 9938375, 99897344, 997002999, 9993948264, 99961946721, 999700029999, 9999516957184, 99994258523375, 999970000299999, 9999934692543307, 99999429057832312, 999997000002999999 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n)=(ceil(10^(n/3))-1)^3 - Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 30 2003

EXAMPLE

a(4) = 9261 = 21^3 has 4 digits while 22^3 = 10648 has 5 digits.

MAPLE

A061435 := n->(ceil(10^(n/3))-1)^3;

CROSSREFS

Cf. A061432, A061433, A061434.

Sequence in context: A033144 A047900 A088038 this_sequence A133054 A098560 A087138

Adjacent sequences: A061432 A061433 A061434 this_sequence A061436 A061437 A061438

KEYWORD

nonn,base,easy

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 03 2001

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org), May 16 2001

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research