This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A163154 #12 Jul 04 2019 13:48:08
%S A163154 5,103,3478759199,116139356908771351,37396512239913013823,
%T A163154 285687842248637730909432643746211633,
%U A163154 1391541769353191693086710038712557510379751,1550980526109101915069808788349000570735950731617761605783
%N A163154 Primes one less than a Golden rectangle number.
%C A163154 Primes of the form A001654(k)-1, generated at k = 3, 6, 24, 42, 48, 86, 102, 138, 182,....
%C A163154 Yet another way of stating the definition: primes of the form F(k)*F(k+1)-1, where F(k) is the k-th Fibonacci number (A000045). - _Colin Barker_, Apr 07 2016
%e A163154 103 is in the sequence because 103 = 8*13-1 = F(6)*F(7)-1.
%t A163154 q=0;lst={};Do[f=Fibonacci[n];If[PrimeQ[f*q-1],AppendTo[lst,f*q-1]];q=f, {n,6!}];lst
%t A163154 f[n_] := Fibonacci@ n Fibonacci[n + 1] - 1; f /@ Select[Range@ 180, PrimeQ[f@ #] &] (* _Michael De Vlieger_, Apr 07 2016 *)
%t A163154 Select[Times@@@Partition[Fibonacci[Range[150]],2,1]-1,PrimeQ] (* _Harvey P. Dale_, Jul 04 2019 *)
%o A163154 (PARI) L=List(); for(k=1, 200, if(isprime(p=fibonacci(k)*fibonacci(k+1)-1), listput(L, p))); Vec(L) /* _Colin Barker_, Apr 07 2016 */
%Y A163154 Cf. A001654, A000045, A119996, A163157, A271428.
%K A163154 nonn
%O A163154 1,1
%A A163154 _Vladimir Joseph Stephan Orlovsky_, Jul 21 2009
%E A163154 Definition reworded by _R. J. Mathar_, Sep 11 2009
%E A163154 a(8) from _Colin Barker_, Apr 07 2016