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 A339567 #22 Feb 10 2021 13:53:30
%S A339567 1,5,15,25,55,91,137,525,625,925,3967,5995,7625,10767,25087,57225,
%T A339567 68817,565027,591415,2515825,2757625,4162019,5276309,96689255,
%U A339567 115686005,133890625,242899421,492029715,588620625,1839399055,7786281065,11231388063,17251448809,71050380625
%N A339567 Numbers k such that A007088(k) == 1 (mod k).
%C A339567 All terms are odd.
%e A339567 a(3) = 15 is a term because 15 = 1111_2 and 1111 == 1 (mod 15).
%p A339567 filter:= t -> convert(t,binary) mod t = 1: filter(1):= true:
%p A339567 select(filter, [seq(i,i=1..10^7,2)]);
%t A339567 Block[{a = {1}, k}, Do[If[Mod[FromDigits@ IntegerDigits[i, 2], i] == 1, AppendTo[a, i]], {i, 2, 10^7}]; a] (* _Michael De Vlieger_, Dec 12 2020 *)
%o A339567 (PARI) isok(n) = Mod(fromdigits(binary(n)), n) == 1;
%o A339567 forstep(k=1, 10^7, 2, if(isok(k), print1(k, ", "))); \\ _Daniel Suteu_, Dec 12 2020
%Y A339567 Cf. A007088, A339566.
%K A339567 nonn,base
%O A339567 1,2
%A A339567 _Robert Israel_, Dec 09 2020
%E A339567 a(30)-a(34) from _Daniel Suteu_, Dec 12 2020