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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096491 a(n) = sqrt(n) of n if n is a perfect square, otherwise a(n) = largest term in period of continued fraction expansion of square root of n. 7
1, 2, 2, 2, 4, 4, 4, 4, 3, 6, 6, 6, 6, 6, 6, 4, 8, 8, 8, 8, 8, 8, 8, 8, 5, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 7, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 8, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

EXAMPLE

n=127: the period={3,1,2,2,7,11,7,2,2,1,3,22}, max=a[127]=22;

MAPLE

A096491 := proc(n)

if issqr(n) then

sqrt(n) ;

else

numtheory[cfrac](sqrt(n), 'periodic', 'quotients') ;

%[2] ;

max(op(%)) ;

end if;

end proc:

# R. J. Mathar, Mar 18 2010

MATHEMATICA

u=1; Do[s=Max[Last[ContinuedFraction[n^(1/2)]]]; tc[[u]]=s; u=u+1, {n, 1, m}]

CROSSREFS

Cf. A003285, A013646.

Sequence in context: A087627 A195051 A219654 * A217871 A106160 A283426

Adjacent sequences:  A096488 A096489 A096490 * A096492 A096493 A096494

KEYWORD

cofr,nonn

AUTHOR

Labos Elemer, Jun 29 2004

EXTENSIONS

Definition revised by N. J. A. Sloane, Mar 18 2010

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 18 14:15 EST 2017. Contains 294893 sequences.