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 A159746 #16 Aug 18 2022 18:15:07
%S A159746 55,274,773,1793,3840,7936,16128,32512,65280,130816,261888,524032,
%T A159746 1048320,2096896,4194048,8388352,16776960,33554176,67108608,134217472,
%U A159746 268435200,536870656,1073741568,2147483392,4294967040,8589934336,17179868928,34359738112
%N A159746 If an array is made of columns of -nacci sequences, fibo-, tribo- etc. all starting w. 1,1,2 etc, the NW to SE diagonals can be extended by computation. The above is diagonal 9. See A159741 for details.
%H A159746 Harvey P. Dale, <a href="/A159746/b159746.txt">Table of n, a(n) for n = 1..1000</a>
%H A159746 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2).
%F A159746 Interpolate a(n)=(4*n^3-30*n^2+92*n+657)/3 offset 0 & b(n)=(-4*n^3+24*n^2-65*n+840)/3 offset 0. Add 55 as a leader. Binomially transform. [From Al Hakanson (hawkuu(AT)gmail.com), Jun 08 2009]
%F A159746 a(n) = 2^(7+n)-256 for n>=5. - _R. J. Mathar_, Feb 04 2021
%t A159746 LinearRecurrence[{3,-2},{55,274,773,1793,3840,7936},30] (* _Harvey P. Dale_, Aug 18 2022 *)
%K A159746 nonn,easy
%O A159746 1,1
%A A159746 Al Hakanson (hawkuu(AT)gmail.com), Apr 20 2009
%E A159746 a(7) and beyond by _R. J. Mathar_, Feb 04 2021