This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A303263 Indices of primes in tribonacci sequence A000073. 2
 4, 6, 7, 11, 87, 98, 215, 802, 4202, 18699, 96879 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS T = A000073 is defined by T(n+1) = T(n) + T(n-1) + T(n-2), T(2) = 1, T(1) = T(0) = 0. The largest terms correspond to unproven probable primes T(a(n)). LINKS FORMULA a(n) = A092835(n) + 1 = index of A092836(n) in A000073. MATHEMATICA -1 + Position[LinearRecurrence[{1, 1, 1}, {0, 0, 1}, 10^4], _?PrimeQ][[All, 1]] (* Michael De Vlieger, Apr 21 2018 *) PROG (PARI) a(n, N=4, S=vector(N, i, i>N-2))={for(i=N, oo, ispseudoprime(S[i%N+1]=2*S[(i-1)%N+1]-S[i%N+1])&&!n--&&return(i))} CROSSREFS Cf. A000073 (= T), A092836 (= T(a(n))), A092835 (= a(n) - 1). Cf. A001605 (indices of primes in Fibonacci numbers A000045). Sequence in context: A102145 A102132 A102143 * A056853 A024566 A166457 Adjacent sequences:  A303260 A303261 A303262 * A303264 A303265 A303266 KEYWORD nonn,hard,more AUTHOR M. F. Hasler, Apr 18 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 21 12:35 EDT 2019. Contains 327253 sequences. (Running on oeis4.)