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 A326422 #30 Jul 15 2025 11:16:00
%S A326422 3,4,6,7,13,14,16,17,23,24,26,27,33,34,36,37,43,44,46,47,53,54,56,57,
%T A326422 63,64,66,67,73,74,76,77,83,84,86,87,93,94,96,97,103,104,106,107,113,
%U A326422 114,116,117,123,124,126,127,133,134,136,137,143,144,146,147,153,154,156,157
%N A326422 Numbers k such that A000045(k) mod 5 is prime.
%C A326422 Position of prime numbers in A082116.
%H A326422 Vincenzo Librandi, <a href="/A326422/b326422.txt">Table of n, a(n) for n = 1..3740</a>
%H A326422 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,1,-1).
%F A326422 G.f.: x*(3*x^2+4*x+3)*(x^2-x+1)/((x+1)*(x^2+1)*(x-1)^2). - _Alois P. Heinz_, Jul 08 2019
%F A326422 E.g.f.: (6 - 2*cos(x) + (5*x - 4)*cosh(x) + 2*sin(x) + (5*x - 1)*sinh(x))/2. - _Stefano Spezia_, Jul 15 2025
%t A326422 Select[Range[160], MemberQ[{2, 3}, Mod[Fibonacci[#], 5]] &]
%o A326422 (Magma) [n: n in [0..200] | IsPrime(Fibonacci(n) mod 5)];
%Y A326422 Cf. A000045, A082116.
%Y A326422 Partial sums of A010123.
%K A326422 nonn,easy
%O A326422 1,1
%A A326422 _Vincenzo Librandi_, Jul 06 2019