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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A146340 Numbers k such that continued fraction of (1+Sqrt[k])/2 has period 17 2
521, 617, 709, 1433, 1597, 2549, 2909, 2965, 3161, 3581, 3821, 4013, 4285, 4649 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

For primes in this sequence see A146362.

EXAMPLE

a(1) = 521 because continued fraction of (1+Sqrt[521])/2 = 11, 1, 10, 2, 5, 4, 2, 1, 1, 1, 1, 2, 4, 5, 2, 10, 1, 21, 1, 10, 2, 5, 4, 2, 1, 1, 1, 1, 2, 4, 5, 2, 10, 1, 21, 1, 10, 2, 5,...

has period (1, 10, 2, 5, 4, 2, 1, 1, 1, 1, 2, 4, 5, 2, 10, 1, 21) length 17

MAPLE

A146326 := proc(n) if not issqr(n) then numtheory[cfrac]( (1+sqrt(n))/2, 'periodic', 'quotients') ; nops(%[2]) ; else 0 ; fi; end: isA146340 := proc(n) RETURN(A146326(n) = 17) ; end: for n from 2 do if isA146340(n) then printf("%d, \n", n) ; fi; od: [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 06 2009]

MATHEMATICA

s = 10; aa = {}; Do[k = ContinuedFraction[(1 + Sqrt[n])/2, 1000]; If[Length[k] < 190, AppendTo[aa, 0], m = 1; While[k[[s ]] != k[[s + m]] || k[[s + m]] != k[[s + 2 m]] || k[[s + 2 m]] != k[[s + 3 m]] || k[[s + 3 m]] != k[[s + 4 m]], m++ ]; s = s + 1; While[k[[s ]] != k[[s + m]] || k[[s + m]] != k[[s + 2 m]] || k[[s + 2 m]] != k[[s + 3 m]] || k[[s + 3 m]] != k[[s + 4 m]], m++ ]; AppendTo[aa, m]], {n, 1, 500}]; bb = {}; Do[If[aa[[n]] == 17, AppendTo[bb, n]], {n, 1, Length[aa]}]; bb (*Artur Jasinski*)

CROSSREFS

A000290, A078370, A146326-A146345, A146348-A146360.

Sequence in context: A183588 A168220 A139663 * A146362 A050966 A113158

Adjacent sequences:  A146337 A146338 A146339 * A146341 A146342 A146343

KEYWORD

more,nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Oct 30 2008

EXTENSIONS

998 and 1006 removed, sequence extended - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 06 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 01:31 EST 2012. Contains 205860 sequences.