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 A219056 #18 Jan 26 2022 12:05:33 %S A219056 0,3,48,243,768,1875,3888,7203,12288,19683,30000,43923,62208,85683, %T A219056 115248,151875,196608,250563,314928,390963,480000,583443,702768, %U A219056 839523,995328,1171875,1370928,1594323,1843968,2121843,2430000,2770563,3145728,3557763,4009008 %N A219056 a(n) = 3*n^4. %H A219056 Reinhard Zumkeller, <a href="/A219056/b219056.txt">Table of n, a(n) for n = 0..1000</a> %H A219056 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5,-10,10,-5,1). %F A219056 a(n) = A219069(n,n) for n > 0; %F A219056 a(n) = A008585(A000583(n)) = A000290(n)*A033428(n). %F A219056 From _Chai Wah Wu_, Jun 22 2016: (Start) %F A219056 a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) for n > 4. %F A219056 G.f.: 3*x*(1 + x)*(1 + 10*x + x^2)/(1 - x)^5. (End) %F A219056 E.g.f.: 3*x*(1 + 7*x + 6*x^2 + x^3)*exp(x). - _G. C. Greubel_, Jun 22 2016 %t A219056 LinearRecurrence[{5,-10,10,-5,1},{0, 3, 48, 243, 768},100] (* or *) Table[3*n^4, {n,0,50}] (* _G. Greubel_, Jun 22 2016 *) %o A219056 (Haskell) %o A219056 a219056 = (* 3) . (^ 4) %o A219056 (Maxima) makelist(3*n^4,n,0,30); /* _Martin Ettl_, Nov 12 2012 */ %o A219056 (PARI) a(n) = 3*n^4; \\ _Michel Marcus_, Jan 26 2022 %Y A219056 Cf. A008585, A000583, A000290, A033428, A219069. %K A219056 nonn,easy %O A219056 0,2 %A A219056 _Reinhard Zumkeller_, Nov 11 2012