cp's OEIS Frontend

A153652 Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2*j + 1)*prime(j)*T(n-2, k-1, j) with T(2, k, j) = prime(j) and j = 7, read by rows.

%I A153652 #22 Mar 05 2021 02:51:16
%S A153652 2,17,17,2,574,2,2,4911,4911,2,2,5423,156192,5423,2,2,5935,1413920,
%T A153652 1413920,5935,2,2,6447,2802720,42656800,2802720,6447,2,2,6959,4322592,
%U A153652 406009120,406009120,4322592,6959,2,2,7471,5973536,1125025312,11689502240,1125025312,5973536,7471,2
%N A153652 Triangle T(n, k, j) =  T(n-1, k, j) + T(n-1, k-1, j) + (2*j + 1)*prime(j)*T(n-2, k-1, j) with T(2, k, j) = prime(j) and j = 7, read by rows.
%H A153652 G. C. Greubel, <a href="/A153652/b153652.txt">Rows n = 1..50 of the triangle, flattened</a>
%F A153652 T(n, k, j) =  T(n-1, k, j) + T(n-1, k-1, j) + (2*j + 1)*prime(j)*T(n-2, k-1, j) with T(2, k, j) = prime(j), T(3, 2, j) = 2*prime(j)^2 - 4, T(4, 2, j) = T(4, 3, j) = prime(j)^2 - 2, T(n, 1, j) = T(n, n, j) = 2 and j = 7.
%F A153652 Sum_{k=0..n} T(n, k, j) = 2*prime(j)^(n-1) for j=7 = 2*A001026(n-1).
%e A153652 Triangle begins as:
%e A153652    2;
%e A153652   17,   17;
%e A153652    2,  574,       2;
%e A153652    2, 4911,    4911,          2;
%e A153652    2, 5423,  156192,       5423,           2;
%e A153652    2, 5935, 1413920,    1413920,        5935,          2;
%e A153652    2, 6447, 2802720,   42656800,     2802720,       6447,       2;
%e A153652    2, 6959, 4322592,  406009120,   406009120,    4322592,    6959,    2;
%e A153652    2, 7471, 5973536, 1125025312, 11689502240, 1125025312, 5973536, 7471, 2;
%t A153652 T[n_, k_, j_]:= T[n,k,j]= If[n==2, Prime[j], If[n==3 && k==2 || n==4 && 2<=k<=3, ((3-(-1)^n)/2)*Prime[j]^(n-1) -2^((3-(-1)^n)/2), If[k==1 || k==n, 2, T[n-1,k,j] + T[n-1,k-1,j] + (2*j+1)*Prime[j]*T[n-2,k-1,j] ]]];
%t A153652 Table[T[n,k,7], {n,12}, {k,n}]//Flatten (* modified by _G. C. Greubel_, Mar 02 2021 *)
%o A153652 (Sage)
%o A153652 @CachedFunction
%o A153652 def f(n,j): return ((3-(-1)^n)/2)*nth_prime(j)^(n-1) - 2^((3-(-1)^n)/2)
%o A153652 def T(n,k,j):
%o A153652     if (n==2): return nth_prime(j)
%o A153652     elif (n==3 and k==2 or n==4 and 2<=k<=3): return f(n,j)
%o A153652     elif (k==1 or k==n): return 2
%o A153652     else: return T(n-1,k,j) + T(n-1,k-1,j) + (2*j+1)*nth_prime(j)*T(n-2,k-1,j)
%o A153652 flatten([[T(n,k,7) for k in (1..n)] for n in (1..12)]) # _G. C. Greubel_, Mar 02 2021
%o A153652 (Magma)
%o A153652 f:= func< n,j | Round(((3-(-1)^n)/2)*NthPrime(j)^(n-1) - 2^((3-(-1)^n)/2)) >;
%o A153652 function T(n,k,j)
%o A153652   if n eq 2 then return NthPrime(j);
%o A153652   elif (n eq 3 and k eq 2 or n eq 4 and k eq 2 or n eq 4 and k eq 3) then return f(n,j);
%o A153652   elif (k eq 1 or k eq n) then return 2;
%o A153652   else return T(n-1,k,j) + T(n-1,k-1,j) + (2*j+1)*NthPrime(j)*T(n-2,k-1,j);
%o A153652   end if; return T;
%o A153652 end function;
%o A153652 [T(n,k,7): k in [1..n], n in [1..12]]; // _G. C. Greubel_, Mar 02 2021
%Y A153652 Cf. this sequence (j=7), A153653 (j=8), A153654 (j=9), A153655 (j=10).
%Y A153652 Cf. A153516, A153518, A153520, A153521, A153648, A153649, A153650, A153651, A153656, A153657.
%Y A153652 Cf. A001026 (powers of 17).
%K A153652 nonn,tabl,easy,less
%O A153652 1,1
%A A153652 _Roger L. Bagula_, Dec 30 2008
%E A153652 Edited by _G. C. Greubel_, Mar 02 2021