A206583 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A206583

The least number s having exactly n threes in the continued fraction of sqrt(s).

2, 11, 28, 335, 69, 1507, 268, 1963, 589, 7675, 1318, 2899, 1549, 11575, 1789, 17371, 3331, 22459, 3319, 23791, 6211, 18019, 6379, 63379, 6694, 17131, 9199, 75331, 10189, 49471, 10429, 75091, 16069, 105991, 17509, 114559, 14221, 152707, 25141, 159031, 20959

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1

LINKS

Table of n, a(n) for n=0..40.

MATHEMATICA

nn = 50; zeros = nn; t = Table[0, {nn}]; k = 2; While[zeros > 0, If[! IntegerQ[Sqrt[k]], cnt = Count[ContinuedFraction[Sqrt[k]][[2]], 3]; If[cnt <= nn && t[[cnt]] == 0, t[[cnt]] = k; zeros--]]; k++]; Join[{2}, t]

CROSSREFS

Cf. A206578 (n ones), A206582 (n twos), A206584 (n fours), A206585 (n fives).

Sequence in context: A345035 A220833 A254627 * A045493 A116038 A213521

Adjacent sequences: A206580 A206581 A206582 * A206584 A206585 A206586

KEYWORD

nonn

AUTHOR

T. D. Noe, Mar 19 2012

STATUS

approved