A254719 Perfect powers of Fibonacci numbers: a(n) = F(m)^k for appropriate m > 2 and k > 1, with F = A000045.

4, 9, 16, 25, 27, 32, 64, 81, 125, 128, 169, 243, 256, 441, 512, 625, 729, 1024, 1156, 2048, 2187, 2197, 3025, 3125, 4096, 6561, 7921, 8192, 9261, 15625, 16384, 19683, 20736, 28561, 32768, 39304, 54289, 59049, 65536, 78125, 131072, 142129, 166375, 177147

Offset

1,1

Comments

Suggested by R. J. Mathar's comment in A105317.

Links

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Example

. A254719 |       |4|   |9|  |16|  |25|27|32|     |64|81|  |125|128|   |169
.         +-------+-+---+-+--+--+--+--+--+--+-----+--+--+--+---+---+---+---
. A105317 |0|1|2|3|4|5|8|9|13|16|21|25|27|32|34|55|64|81|89|125|128|144|169
.         +-+-+-+-+-+-+-+-+--+--+--+--------+--+--+-----+--+-------+---+---
. A000045 |0|1|2|3| |5|8| |13|  |21|        |34|55|     |89|       |144|

Prog

(Haskell)
a254719 n = a254719_list !! (n-1)
a254719_list = g (0 : drop 2 a000045_list) a105317_list where
   g fs'@(f:fs) (x:xs) = if x == f then g fs xs else x : g fs' xs

Crossrefs

A105317 without A000045; cf. A001597.

Sequence in context: A067115 A061077 A292675 * A266918 A086132 A010433

Adjacent sequences: A254716 A254717 A254718 * A254720 A254721 A254722

Keyword

nonn

Author

Reinhard Zumkeller, Feb 06 2015

Status

approved