Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090568
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A090568 Least m such that m^n begins with k^(n-1) for some k > 1. +0
2
1, 2, 4, 3, 7, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) = 10 for 6 <= n <= 500 (I haven't checked past 500.) - David Wasserman (wasserma(AT)spawar.navy.mil), Jan 05 2006

FORMULA

a(n) = A090561(n)^(1/n). - David Wasserman (wasserma(AT)spawar.navy.mil), Jan 05 2006

CROSSREFS

Cf. A090561.

Sequence in context: A127002 A027634 A101267 this_sequence A166017 A035507 A138612

Adjacent sequences: A090565 A090566 A090567 this_sequence A090569 A090570 A090571

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Dec 11 2003

EXTENSIONS

Corrected and extended by David Wasserman (wasserma(AT)spawar.navy.mil), Jan 05 2006

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 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research