login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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,... 3
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

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 A207409 A013632

Adjacent sequences:  A049840 A049841 A049842 * A049844 A049845 A049846

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 20 02:13 EST 2019. Contains 319320 sequences. (Running on oeis4.)