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 A356122 #14 Aug 25 2022 16:22:40
%S A356122 2,1,2,3,2,2,4,2,2,4,3,2,4,2,3,5,2,2,5,2,3,5,3,2,4,3,3,5,3,2,6,2,2,5,
%T A356122 3,4,5,2,3,5,3,2,6,2,3,7,3,2,4,3,4,5,3,2,6,4,3,5,3,2,6,2,3,7,2,4,6,2,
%U A356122 3,5,5,2,5,2,3,7,3,4,6,2,3,6,3,2,6,4,3,5,3,2,8,4,3,5,3,4,4,2,4,7
%N A356122 Number of Lucas divisors of the n-th Lucas number.
%H A356122 Daniel Suteu, <a href="/A356122/b356122.txt">Table of n, a(n) for n = 0..10000</a>
%F A356122 a(n) = A304092(A000032(n)).
%o A356122 (PARI) L(n)=fibonacci(n+1)+fibonacci(n-1); \\ A000032
%o A356122 isld(n) = { my(u1=1, u2=3, old_u1); if(n<=2, sign(n), while(n>u2, old_u1=u1; u1=u2; u2=old_u1+u2); (u2==n)); }; \\ A102460
%o A356122 nbld(n) = sumdiv(n, d, isld(d)); \\ A304092
%o A356122 a(n) = nbld(L(n));
%o A356122 (PARI) a(n) = if(n==1, return(1)); my(k=fibonacci(n+1)+fibonacci(n-1),c=0,x=2,y=1); while(x <= k, if(k%x == 0, c++); [x,y]=[y,x+y]); c; \\ _Daniel Suteu_, Aug 25 2022
%Y A356122 Cf. A000032, A102460, A304092, A356062, A356123.
%Y A356122 Cf. A076984 (similar for Fibonacci numbers).
%K A356122 nonn
%O A356122 0,1
%A A356122 _Michel Marcus_, Jul 27 2022