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 A271782 #81 Jul 09 2025 10:18:53 %S A271782 13,241,2,3,191,5,2,3,2683 %N A271782 Smallest n-Wall-Sun-Sun prime. %C A271782 A prime p is a k-Wall-Sun-Sun prime iff p^2 divides F_k(pi_k(p)), where F_k(n) is the k-Fibonacci numbers, i.e., a Lucas sequence of first kind with (P,Q) = (k,-1), and pi_k(p) is the Pisano period of k-Fibonacci numbers modulo p (cf. A001175, A175181-A175185). %C A271782 For prime p > 2 not dividing k^2 + 4, it is a k-Wall-Sun-Sun prime iff p^2 | F_k(p-((k^2+4)/p)), where ((k^2+4)/p) is the Kronecker symbol. %C A271782 a(1) would be the smallest Wall-Sun-Sun prime whose existence is an open question. %C A271782 a(12)..a(16) = 2, 3, 3, 29, 2. a(18)..a(33) = 3, 11, 2, 23, 3, 3, 2, 5, 79, 3, 2, 7, 23, 3, 2, 239. a(36)..a(38) = 2, 7, 17. a(40), a(41) = 2, 3. a(43)..a(46) = 5, 2, 3, 41. - _R. J. Mathar_, Apr 22 2016 %C A271782 a(17) = 1192625911, a(35) = 153794959, a(39) = 30132289567, a(47)..a(50) = 139703, 2, 3, 3. If they exist, a(11), a(34), a(42) are greater than 10^12. - _Max Alekseyev_, Apr 26 2016 %C A271782 Column k = 1 of table T(n, k) of k-th n-Wall-Sun-Sun prime (that table is not yet in the OEIS as a sequence). - _Felix Fröhlich_, Apr 25 2016 %C A271782 From Richard N. Smith, Jul 16 2019: (Start) %C A271782 a(n) = 2 if and only if n is divisible by 4. %C A271782 a(n) = 3 if and only if n == 5, 9, 13, 14, 18, 22, 23, 27, 31 (mod 36). (End) %H A271782 Sergio Falcon and Ángel Plaza, <a href="http://dx.doi.org/10.1016/j.chaos.2008.02.014">k-Fibonacci sequences modulo m</a>, Chaos, Solit. Fractals 41:1 (2009), 497-504. %H A271782 Richard N. Smith, <a href="/A271782/a271782_1.txt">Table of n, a(n) for n = 1..1024 (or 0 if unknown, searched up to 2^22)</a> %H A271782 Richard N. Smith, <a href="/A271782/a271782.txt">List of odd n-Wall-Sun-Sun primes <= 2^20 for 1<=n<=1024</a> %H A271782 Wikipedia, <a href="https://en.wikipedia.org/wiki/Wall-Sun-Sun_prime">Wall-Sun-Sun prime</a> %F A271782 a(4n) = 2. %o A271782 (PARI) A271782(k) = forprime(p=2,10^8, if( (([0,1;1,k]*Mod(1,p^2))^(p-kronecker(k^2+4,p)))[1,2]==0, return(p);); ); \\ _Max Alekseyev_, Apr 22 2016, corrected by Richard N. Smith, Jul 16 2019 to include p=2 and p divides k^2+4 %Y A271782 Cf. A001177, A039951, A113649, A113650, A113651, A214028, A237517, A237835, A241014, A244801, A253247, A268478. %K A271782 nonn,more,hard %O A271782 2,1 %A A271782 _Felix Fröhlich_, Apr 18 2016 %E A271782 Edited by _Max Alekseyev_, Apr 25 2016