login
a(n) = (5*n + 1)*(5*n + 2)*(5*n + 3).
1

%I #31 Jan 26 2023 10:10:16

%S 6,336,1716,4896,10626,19656,32736,50616,74046,103776,140556,185136,

%T 238266,300696,373176,456456,551286,658416,778596,912576,1061106,

%U 1224936,1404816,1601496,1815726,2048256,2299836,2571216,2863146,3176376,3511656,3869736,4251366

%N a(n) = (5*n + 1)*(5*n + 2)*(5*n + 3).

%H T. D. Noe, <a href="/A001509/b001509.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).

%F a(n) = A016861(n) * A016873(n) * A016885(n). - _Wesley Ivan Hurt_, May 07 2014

%F G.f.: 6*(1 + 52*x + 68*x^2 + 4*x^3)/(1 - x)^4. - _Stefano Spezia_, Jan 03 2023

%F Sum_{n>=0} 1/a(n) = sqrt(2*(25-11*sqrt(5))/5)*Pi/20 + log(phi)/(2*sqrt(5)), where phi is the golden ratio (A001622). - _Amiram Eldar_, Jan 26 2023

%p A001509:=n->(5*n+1)*(5*n+2)*(5*n+3); seq(A001509(n), n=0..50); # _Wesley Ivan Hurt_, May 07 2014

%t Table[(5*n + 1)*(5*n + 2)*(5*n + 3), {n, 0, 100}] (* _Harvey P. Dale_, Apr 21 2011 *)

%Y Cf. A001622, A016861, A016873, A016885.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_, Dec 11 1996