login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088901 Numbers n such that n*k(n) is an integer, where k(n) is sum of successive remainders when computing the Euclidean algorithm for (1, 1/sqrt(n)) as defined in A086378 (MuPAD program is given there). 0
1, 2, 4, 9, 12, 16, 25, 30, 36, 49, 55, 56, 64, 70, 81, 90, 100, 121, 132, 144, 169, 180, 182, 196, 225, 240, 256, 289, 305, 306, 324, 361, 377, 380, 400, 441, 462, 484, 529, 552, 576, 625, 646, 650, 676, 729, 755, 756, 784, 841, 870, 900, 961, 987, 990, 992 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Subset of A086378 and A088900.

LINKS

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

CROSSREFS

Cf. A086378 and A088900.

Sequence in context: A219114 A182859 A341239 * A283147 A111302 A241200

Adjacent sequences:  A088898 A088899 A088900 * A088902 A088903 A088904

KEYWORD

nonn

AUTHOR

Thomas Baruchel, Oct 21 2003

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 July 25 09:49 EDT 2021. Contains 346289 sequences. (Running on oeis4.)