This site is supported by donations to The OEIS Foundation.

 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!)
 A096496 Count of distinct primes in period of continued fraction of square root of n-th prime. 2
 1, 1, 0, 0, 1, 0, 0, 2, 1, 1, 2, 0, 1, 2, 1, 1, 2, 2, 3, 2, 1, 1, 0, 2, 1, 0, 1, 1, 2, 1, 4, 2, 1, 4, 2, 4, 3, 4, 1, 0, 4, 1, 3, 2, 0, 3, 4, 1, 0, 1, 1, 2, 2, 2, 0, 0, 1, 1, 3, 1, 1, 0, 4, 3, 3, 1, 5, 3, 2, 2, 2, 1, 3, 2, 4, 2, 1, 2, 0, 3, 4, 5, 5, 3, 1, 0, 3, 4, 1, 4, 1, 3, 3, 2, 1, 1, 2, 2, 2, 4, 4, 0, 2, 3, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 LINKS EXAMPLE n=31,p[31]=127: the period={3,1,2,2,7,11,7,2,2,1,3,22}, so a[31]=4; MATHEMATICA {te=Table[0, {m}], u=1}; Do[s=Count[PrimeQ[Union[Last[ContinuedFraction[f[n]^(1/2)]]]], True]; te[[u]]=s; u=u+1, {n, 1, m}]; te Count[Union[ContinuedFraction[Sqrt[#]][[2]]], _?PrimeQ]&/@Prime[ Range[ 110]] (* Harvey P. Dale, Apr 27 2016 *) CROSSREFS Cf. A003285, A054269, A005980, A096491-A096495. Sequence in context: A157188 A173266 A224326 * A117209 A035192 A229653 Adjacent sequences:  A096493 A096494 A096495 * A096497 A096498 A096499 KEYWORD cofr,nonn AUTHOR Labos Elemer, Jun 29 2004 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.