This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A254719 #7 Aug 20 2019 07:24:13 %S A254719 4,9,16,25,27,32,64,81,125,128,169,243,256,441,512,625,729,1024,1156, %T A254719 2048,2187,2197,3025,3125,4096,6561,7921,8192,9261,15625,16384,19683, %U A254719 20736,28561,32768,39304,54289,59049,65536,78125,131072,142129,166375,177147 %N A254719 Perfect powers of Fibonacci numbers: a(n) = F(m)^k for appropriate m > 2 and k > 1, with F = A000045. %C A254719 Suggested by _R. J. Mathar_'s comment in A105317. %H A254719 Reinhard Zumkeller, <a href="/A254719/b254719.txt">Table of n, a(n) for n = 1..10000</a> %e A254719 . A254719 | |4| |9| |16| |25|27|32| |64|81| |125|128| |169 %e A254719 . +-------+-+---+-+--+--+--+--+--+--+-----+--+--+--+---+---+---+--- %e A254719 . A105317 |0|1|2|3|4|5|8|9|13|16|21|25|27|32|34|55|64|81|89|125|128|144|169 %e A254719 . +-+-+-+-+-+-+-+-+--+--+--+--------+--+--+-----+--+-------+---+--- %e A254719 . A000045 |0|1|2|3| |5|8| |13| |21| |34|55| |89| |144| %o A254719 (Haskell) %o A254719 a254719 n = a254719_list !! (n-1) %o A254719 a254719_list = g (0 : drop 2 a000045_list) a105317_list where %o A254719 g fs'@(f:fs) (x:xs) = if x == f then g fs xs else x : g fs' xs %Y A254719 A105317 without A000045; cf. A001597. %K A254719 nonn %O A254719 1,1 %A A254719 _Reinhard Zumkeller_, Feb 06 2015