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 A079299 #7 Jan 03 2019 13:29:26 %S A079299 6,14,22,30,38,42,46,62,66,70,78,86,94,102,110,114,118,134,138,142, %T A079299 150,154,158,166,174,182,186,190,198,206,210,214,222,230,238,246,254, %U A079299 258,262,266,270,278,282,286,294,302,310,318,322,326,330,334,350,354,358 %N A079299 Not a binomial number: not of form a^k +- b^k for k >= 2. %H A079299 Robert Israel, <a href="/A079299/b079299.txt">Table of n, a(n) for n = 1..3614</a> %p A079299 N:= 1000: # to get all terms <= N %p A079299 kmax:= floor(LambertW(2*ln(2)*N)/ln(2)): %p A079299 S:= {}; %p A079299 for k from 2 to kmax do %p A079299 bmax:= floor((N/k)^(1/(k-1))); %p A079299 S:= S union select(`<=`,{seq(seq(b^k-a^k,a=0..b-1),b=1..bmax), seq(seq(b^k+a^k,a=0..b),b=1..floor(N^(1/k)))},N); %p A079299 od: %p A079299 sort(convert({$1..N} minus S,list)); # _Robert Israel_, Jan 03 2019 %Y A079299 Complement of A079298. %K A079299 nonn %O A079299 1,1 %A A079299 _David W. Wilson_, Feb 09 2003