Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A165315
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A165315 a(1)=2. If s is the largest integer such that n = r^s, r = positive integer, then a(n) = the smallest integer > a(n-1) such that a(n) = t^s, t = positive integer. +0
1
2, 3, 4, 9, 10, 11, 12, 27, 36, 37, 38, 39, 40, 41, 42, 81 (list; graph; listen)
OFFSET

1,1

COMMENT

The variable s need not necessarily be the largest integer such that a(n) = t^s, t = some positive integer. (For example, a(3) = 4 because 4 is a first power, like 3.)

If a(1) had equaled 1 instead, then the sequence would have been just the sequence of positive integers, obviously.

EXAMPLE

a(9) = 36 because 9 = 3^2, and because 36 is the smallest square > a(8) = 27.

CROSSREFS

Sequence in context: A037468 A047454 A081870 this_sequence A047339 A084368 A007498

Adjacent sequences: A165312 A165313 A165314 this_sequence A165316 A165317 A165318

KEYWORD

more,nonn

AUTHOR

Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Sep 14 2009

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 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research