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 A271309 #20 May 19 2024 02:13:54 %S A271309 52,60,65,74,75,76,85,108,111,121,124,125,127,131,132,140,144,150,153, %T A271309 156,158,172,175,180,183,185,195,201,209,213,216,220,225,250,263,287, %U A271309 300,301,327,328,335,337,339,344,356,370,402,404,408,412,417,423,433,435 %N A271309 Integers k such that A264137(k) < A060385(k). %C A271309 For all corresponding values of k, A000129(k) is a composite number. In other words, k cannot be a term of A096650. %H A271309 Amiram Eldar, <a href="/A271309/b271309.txt">Table of n, a(n) for n = 1..74</a> %e A271309 52 is a term because A264137(52) = 66923 < A060385(52) = 90481. %o A271309 (PARI) a060385(n) = my(f=factor(fibonacci(n))[, 1]); f[#f]; %o A271309 a000129(n) = ([2, 1; 1, 0]^n)[2, 1]; %o A271309 a264137(n) = my(p=factor(a000129(n))[, 1]); p[#p]; %o A271309 lista(nn) = for(n=3, nn, if(a264137(n) < a060385(n), print1(n, ", "))); %Y A271309 Cf. A060385, A096650, A264137. %K A271309 nonn %O A271309 1,1 %A A271309 _Altug Alkan_, Apr 03 2016 %E A271309 a(37)-a(54) from _Amiram Eldar_, May 19 2024