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!)
A049837 Triangular array T read by rows: T(n,k)=number of distinct numbers that appear when Euclidean algorithm acts on n,k, for k=1,2,...,n; n=1,2,3,... 2
2, 3, 3, 3, 4, 3, 3, 3, 4, 3, 3, 4, 5, 4, 3, 3, 4, 4, 5, 4, 3, 3, 5, 5, 5, 5, 4, 3, 3, 4, 5, 4, 6, 6, 4, 3, 3, 5, 3, 5, 5, 6, 6, 4, 3, 3, 4, 4, 4, 4, 6, 6, 6, 4, 3, 3, 5, 5, 6, 5, 5, 6, 6, 6, 4, 3, 3, 4, 4, 4, 5, 4, 6, 6, 5, 6, 4, 3, 3, 5, 5, 5, 6, 5, 5, 7, 6, 5, 6 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..89.

CROSSREFS

Sequence in context: A088093 A282352 A256858 * A322988 A098201 A175239

Adjacent sequences:  A049834 A049835 A049836 * A049838 A049839 A049840

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 17 22:51 EST 2019. Contains 319251 sequences. (Running on oeis4.)