A049843 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,...

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

Offset

2,3

Links

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

Example

Rows: {1}; {1,2}; {1,1,2}; ...
Example: T(4,3)=2 since remainders for 7=p(4) and 5=p(3) are 2,1,0; to wit, 7=1*5+2, 5=2*2+1, 2=2*1+0.

Crossrefs

Sequence in context: A128259 A051194 A134838 * A131374 A360286 A207409

Adjacent sequences: A049840 A049841 A049842 * A049844 A049845 A049846

Keyword

nonn,tabl

Author

Clark Kimberling

Status

approved