reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
Triangle begins:
{1};
{1,2};
Rows: {1}; {1,2}; {1,1,2}; ...
...
Example: T(4,3)=2 since remainders for 7=pprime(4) and 5=pprime(3) are 2,1,0; to wit, 7=1*5+2, 5=2*2+1, 2=2*1+0.
Triangular array T read by rows: T(n,k)=number of nonzero remainders when Euclidean algorithm acts on primes pprime(n) and pprime(k), k=1,2,...,n-1; n=2,3,4,...
Cf. A049816.
approved
editing
Clark Kimberling (ck6(AT)evansville.edu)
Triangular array T read by rows: T(n,k)=number of nonzero remainders when Euclidean algorithm acts on primes p(n) and p(k), k=1,2,...,n-1; n=2,3,4,...
nonn,tabl,new
nonn,tabl,new
Clark Kimberling, (ck6(AT)evansville.edu)
nonn,tabl,new
Clark Kimberling, ck6@cedar.(AT)evansville.edu
Array Triangular array T by rows: T(n,k)=number of nonzero remainders when Euclidean algorithm acts on primes p(n) and p(k), k=1,2,...,n-1; n=2,3,4,...
nonn,tabl,new