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 A131609 #10 Feb 06 2019 23:54:57 %S A131609 1,1,1,1,1,1,1,2,4,8,1,3,9,27,81,1,5,25,125,625,3125,1,8,64,512,4096, %T A131609 32768,262144,1,13,169,2197,28561,371293,4826809,62748517,1,21,441, %U A131609 9261,194481,4084101,85766121,1801088541,37822859361,1,34,1156,39304 %N A131609 Mirror image of triangle in A131606. %C A131609 Row sums give A131612, %H A131609 Nathaniel Johnston, <a href="/A131609/b131609.txt">Table of n, a(n) for n = 0..1325</a> %F A131609 Row n gives f^0, f^1, f^2, ..., f^n, where f = Fibonacci(n) = A000045(n). %e A131609 Triangle begins: %e A131609 1 %e A131609 1 1 %e A131609 1 1 1 %e A131609 1 2 4 8 %e A131609 1 3 9 27 81 %e A131609 1 5 25 125 625 3125 %e A131609 1 8 64 512 4096 32768 262144 %e A131609 ... %p A131609 with(combinat): A131609 := proc(n,k) return fibonacci(n)^k: end: seq(seq(A131609(n,k), k=0..n), n=0..10); # _Nathaniel Johnston_, May 01 2011 %Y A131609 Cf. A000045, A131606. %K A131609 nonn,tabl,easy %O A131609 0,8 %A A131609 _Roger L. Bagula_ and _Gary W. Adamson_, May 27 2008 %E A131609 Edited by _N. J. A. Sloane_, May 28 2008