Lucasian pseudoprimes: composite numbers k such that 2^(k-1) == k+1 (mod k(2k+1)).

Terms

a(0) =150851a(1) =452051a(2) =1325843a(3) =1441091a(4) =4974971a(5) =5016191a(6) =15139199a(7) =19020191a(8) =44695211a(9) =101276579a(10) =119378351a(11) =128665319a(12) =152814531a(13) =187155383a(14) =203789951a(15) =223782263a(16) =307367171a(17) =387833531a(18) =392534231a(19) =470579831a(20) =505473263a(21) =546748931a(22) =626717471a(23) =639969891a(24) =885510239a(25) =974471243a(26) =1147357559