|
%I #22 Sep 08 2022 08:44:43
%S 1,1792160394037,2384185791015625,177917621779460413,
%T 3909821048582988049,43513917611435838661,313726685568359708377,
%U 1673432436896142578125,7153014030880804126753,25804264053054077850709,81402749386839761113321,230339304218442143770717
%N a(n) = (12*n + 1)^11.
%H Matthew House, <a href="/A017543/b017543.txt">Table of n, a(n) for n = 0..10000</a>
%H <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (12, -66, 220, -495, 792, -924, 792, -495, 220, -66, 12, -1).
%F a(n) = A008455(A017533(n)). - _Michel Marcus_, Jul 28 2015
%F a(n) = Sum_{k=0..11} binomial(11,k)*(12*n)^k. - _Robert Israel_, Jul 28 2015
%p seq((12*n+1)^11, n=0..100); # _Robert Israel_, Jul 28 2015
%o (PARI) vector(20, n, n--; (12*n+1)^11) \\ _Michel Marcus_, Jul 28 2015
%o (Magma) [(12*n+1)^11: n in [0..12]]; // _Vincenzo Librandi_, Jul 29 2015
%Y Cf. A008455 (n^11), A017533 (12n+1).
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_
|
