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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A219281 Smallest number k such that ChebyshevT[2^n, k] is prime. 0
 2, 2, 2, 3, 2, 8, 164, 29, 60, 213, 181, 652 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS ChebyshevT[2^n,x] is the 2^n th Chebyshev polynomial of the first kind evaluated at x. LINKS Table of n, a(n) for n=0..11. EXAMPLE T(1, x) = x => T(1,2) = 2 is prime => a(0) = 2; T(2, x) = 2x^2 - 1 => T(2, 2) = 7 is prime => a(1) = 2; T(4, x) = 8x^4 - 8x^2 + 1 => T(4,2) = 97 is prime => a(2) = 2. MAPLE for n from 0 to 11 do P:= unapply(orthopoly[T](2^n, x), x): for k from 1 do if isprime(P(k)) then A[n]:= k; break fi od od: seq(A[n], n=0..11); # Robert Israel, Aug 13 2018 MATHEMATICA Table[k = 0; While[!PrimeQ[ChebyshevT[2^n, k]], k++]; k, {n, 0, 7}] CROSSREFS Cf. A066436, A144131, A144132, A219276, A219277, A219278, A219279, A219280. Sequence in context: A058614 A122765 A131053 * A125600 A084053 A331553 Adjacent sequences: A219278 A219279 A219280 * A219282 A219283 A219284 KEYWORD nonn,hard,more AUTHOR Michel Lagneau, Nov 17 2012 EXTENSIONS a(10) and a(11) from Robert Israel, Aug 13 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 3 09:58 EDT 2024. Contains 374885 sequences. (Running on oeis4.)