Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083378
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083378 a(n) = the largest integer whose cube has n digits and first digit 1; but a(2)=2. +0
1
1, 2, 5, 12, 27, 58, 125, 271, 584, 1259, 2714, 5848, 12599, 27144, 58480, 125992, 271441, 584803, 1259921, 2714417, 5848035, 12599210, 27144176, 58480354, 125992104, 271441761, 584803547, 1259921049, 2714417616, 5848035476 (list; graph; listen)
OFFSET

1,2

COMMENT

a(2)=2 because there is no integer with cube between 10 and 19.

A generalization to arbitrary powers is found in Huerlimann, 2003.

Non-mathematical comment: the line with the Huerlimann reference causes the mail program "mail-dark" to think the line contains a virus. - njas, Nov 10 2005

REFERENCES

W. Huerlimann, Integer powers and Benford's law, preprint, 2003, available at www.mathpreprints.com/math/Preprint/werner.huerlimann/20030603/1 or at www.geocities.com/hurlimann53 (list of publications)

FORMULA

a(n)=floor(cuberoot(10^n/5))

CROSSREFS

Cf. A061439, A083377-A083380.

Sequence in context: A000325 A076878 A129983 this_sequence A116712 A000102 A086589

Adjacent sequences: A083375 A083376 A083377 this_sequence A083379 A083380 A083381

KEYWORD

base,easy,nonn

AUTHOR

Werner S. Huerlimann [H\"{u}rlimann] (whurlimann(AT)bluewin.ch), Jun 05 2003

EXTENSIONS

Edited by Don Reble (djr(AT)nk.ca), Nov 05 2005

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 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research