OFFSET
1,1
COMMENTS
For a, b integers, the following sequences are defined:
generalized Lucas sequences by U(n+2)=a*U(n+1)-b*U(n) and U(0)=0, U(1)=1,
generalized Pell-Lucas sequences by V(n+2)=a*V(n+1)-b*V(n) and V(0)=2, V(1)=a.
These satisfy the identities U(p)^2 == 1 and V(p)==a (mod p) for p prime and b=1,-1.
These numbers may be called weak generalized Lucas-Bruckner pseudoprimes of parameters a and b. The current sequence is defined for a=5 and b=1.
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..10000
D. Andrica and O. Bagdasar, On some new arithmetic properties of the generalized Lucas sequences, preprint for Mediterr. J. Math. 18, 47 (2021).
MATHEMATICA
Select[Range[3, 10000, 2], CompositeQ[#] && Divisible[2*ChebyshevT[#, 5/2] - 5, #] && Divisible[ChebyshevU[#-1, 5/2]*ChebyshevU[#-1, 5/2] - 1, #] &]
PROG
(Python)
from itertools import islice
from sympy import nextprime
def A337779_gen(): # generator of terms
a, b, c, d, a2, b2, c2, d2 = 5, -1, 1, 0, 1, 0, 0, 1
for x in bin(n)[2:]:
e, f = b2*c2%m, k if (k:=a2+d2)<m else k-m
a2, b2, c2, d2 = (a2*a2+e)%m, b2*f%m, c2*f%m, (d2*d2+e)%m
if x=='1':
a2, b2, c2, d2 = (a2*a+b2*c)%m, (a2*b+b2*d)%m, (c2*a+d2*c)%m, (c2*b+d2*d)%m
return c2, (5*c2+(d2<<1))%m
p, q = 9, 11
while True:
for m in range(p, q, 2):
a, b = f(m, m)
if pow(a, 2, m)==1 and b==5:
yield m
p, q = q+2, nextprime(q)
CROSSREFS
KEYWORD
nonn,changed
AUTHOR
Ovidiu Bagdasar, Sep 20 2020
EXTENSIONS
More terms from Amiram Eldar, Sep 21 2020
STATUS
approved
