A049843 - OEIS

A049843

Triangular array T read by rows: T(n,k)=number of nonzero remainders when Euclidean algorithm acts on primes prime(n) and prime(k), k=1,2,...,n-1; n=2,3,4,...

1, 1, 2, 1, 1, 2, 1, 2, 1, 3, 1, 1, 3, 2, 2, 1, 2, 2, 2, 3, 2, 1, 1, 2, 3, 4, 2, 2, 1, 2, 3, 2, 1, 3, 3, 3, 1, 2, 2, 1, 4, 2, 4, 3, 3, 1, 1, 1, 2, 3, 4, 4, 5, 3, 2, 1, 1, 2, 2, 3, 3, 3, 2, 5, 5, 2, 1, 2, 1, 2, 4, 2, 3, 2, 5, 4, 2, 2, 1, 1, 3, 1, 2, 2, 3, 3

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

2,3

LINKS

Table of n, a(n) for n=2..87.

EXAMPLE

Triangle begins:

{1};

{1,2};

{1,1,2};

...

T(4,3)=2 since remainders for 7=prime(4) and 5=prime(3) are 2,1,0; to wit, 7=1*5+2, 5=2*2+1, 2=2*1+0.