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 A327260 #24 Jan 10 2021 22:24:08
%S A327260 1,3,5,7,9,11,15,17,19,21,25,27,29,31,35,37,39,45,47,49,51,55,57,61,
%T A327260 65,67,69,71,75,79,81,87,89,91,97,99,101,105,107,109,115,117,119,121,
%U A327260 125,127,129,135,139,141,147,151,155,157,159,161,165,169
%N A327260 Odd numbers not of the form 2*n*k - n - k + 1 where n and k are odd numbers > 1.
%C A327260 Terms are the odd numbers not appearing in array A327259 with its first row and column omitted.
%H A327260 Robert Israel, <a href="/A327260/b327260.txt">Table of n, a(n) for n = 1..10000</a>
%p A327260 N:= 201: # for terms <= N
%p A327260 f:= (n,k) -> 2*n*k-n-k+1:
%p A327260 S:= {seq(i,i=1..N,2)} minus {seq(seq(f(n,k),k=3..min(N,(N+n-1)/(2*n-1)),2),n=3..(N+2)/5,2)}:
%p A327260 sort(convert(S,list)); # _Robert Israel_, Sep 09 2020
%t A327260 Select[2 Range[100]-1, FindInstance[# == 1 + 2*n + k (2 + 8 n) && n>0 && k>0, {n, k}, Integers] === {} &] (* _David Lovler_, Dec 28 2020 *)
%Y A327260 Cf. A307001, A327259, A327261.
%K A327260 nonn
%O A327260 1,2
%A A327260 _David Lovler_, Aug 27 2019
%E A327260 Corrected by _Robert Israel_, Sep 09 2020