OFFSET
1,1
EXAMPLE
A103379(20) = 3, which is prime, hence 3 is in this sequence.
MAPLE
A103379 := proc(n) option remember ; if n <= 12 then 1; else procname(n-11)+procname(n-12) ; fi; end: isA103379 := proc(n) option remember ; local i ; for i from 1 do if A103379(i) = n then RETURN(true) ; elif A103379(i) > n then RETURN(false) ; fi; od: end: A103389 := proc(n) option remember ; local a; if n = 1 then 2; else for a from procname(n-1)+1 do if isprime(a) then if isA103379(a) then RETURN(a) ; fi; fi; od: fi; end: for n from 1 to 37 do printf("%d, ", A103389(n)) ; od: # R. J. Mathar, Aug 30 2008
MATHEMATICA
Clear[a]; k11; Do[a[n]=1, {n, k+1}]; a[n_]:=a[n]=a[n-k]+a[n-k-1]; A103389=Union[Select[Array[a, 1000], PrimeQ]] N[Solve[x^12 - x - 1 == 0, x], 111][[2]] (* Program, edit and extension by Ray Chandler and Robert G. Wilson v, irrelevant code deleted by M. F. Hasler, Sep 19 2015 *)
Select[LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1}, {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 700], PrimeQ]//Union (* Harvey P. Dale, Apr 22 2016 *)
PROG
(PARI) {a=vector(m=12, n, 1); L=0; for(n=m, 10^5, isprime(a[i=n%m+1]+=a[(n+1)%m+1])&&L<a[i]&&print1(L=a[i], ", "))} \\ M. F. Hasler, Sep 19 2015
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Jonathan Vos Post, Feb 15 2005
EXTENSIONS
Corrected from a(16) on by R. J. Mathar, Aug 30 2008
Edited and more terms added by M. F. Hasler, Sep 19 2015
STATUS
approved